6 problems
Inherited correspondence conjecture. The maximum number of edges in a subgraph of in which every collection of disjoint cycles covers at most vertices equals the larges…
Let be a field of characteristic with more than elements. Let be a -spec subspace of , with…
Let be a field of characteristic with more than elements. Let be a -spec subspace of with ……
Let be a field of characteristic with more than elements, and let be a -spec subspace of . Characteristi…
Let be a field of characteristic with more than elements, and let be a -spec subspace of . Characteristic-two…
Let be a -spec subspace of such that … Assume . A linear subspace of has a trivial spectrum if no…