17 problems
Let and let be the -uniform Kneser hypergraph on the -subsets of , with edges consisting of pairwise disjoint vertices. Let…
For positive integers with , let be the -uniform Kneser hypergraph whose vertices are the -element subsets of and whos…
Let , and let be the induced -uniform Kneser hypergraph whose vertices are the -stable -subsets of , where…
Let , let be a hypergraph over the ground set , and let . Write for the correspo…
Let , let , and let be a hypergraph over the ground set . Write for the hypergraph obtained by restric…
For , let be the hypergraph whose vertices are the -subsets of and whose edges are the -tuples of pairwise disjoint -sets. A s…
Let , , and , and let be a family of subsets of . For the almost -stable subfamily , let be the…
Let be integers with and , and let be the -uniform hypergraph whose vertices are the -subsets of and whos…
For positive integers with , let be the Kneser hypergraph whose vertices are the -element subsets of…
Let be a positive integer, and let be a path whose vertex set is partitioned into subsets , each of size at least . A set of vertices is -stable…
Let , , and be positive integers with , , and . Define … Here is the random -uniform Knes…
Let , and let be the subhypergraph of the -uniform Kneser hypergraph induced by the -subsets with …
Let , , and be integers, and let be a partition of such that for every . Let…
Let , , and , and consider colorings of in which any same-colored members contain some members with a common element. Lange–Ziegle…
For positive integers with , , and , let be the -stable -uniform Kneser hypergraph, and let be…
Let , , and be positive integers, and let be the -uniform Kneser hypergraph whose vertices are the -subsets of , with adjacency give…
Erdős's conjecture. This bound is sharp for all , that is,