11 problems
Let be the Kneser hypergraph whose vertices are the -element subsets of , and call a subset -stable when any two elements satisfy…
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 and let be a set system. Write for the family obtained by retaining the source's weakened notion of…
Let , , and , and let be a family of subsets of . For the almost -stable subfamily , let be the…
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 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…
For positive integers with , , and , let be the -stable -uniform Kneser hypergraph, and let be…
Ziegler–Alon–Drewnowski–Łuczak conjecture.
Let and be hypergraphs. Their categorical product has vertex set and edges whose projections…