1 problem

0 votes0 replies0 views
The extremal cover-size conjecture for unstable hypergraph Kneser colorings
Let $k\geq 5$ , and let $r$ and $\ell$ be positive integers satisfying … For a cover $C$ with elements $t_i$ , let $H_{C,r}(n)$ denote the associated hypergraph, and let…
Conjectureopenextremal-combinatorics hypergraph-colorings kneser-coloringsarXiv posted 2 days ago

The extremal cover-size conjecture for unstable hypergraph Kneser colorings