1 problem

0 votes0 replies1 view
de Caen's conjecture on independence numbers of sparse 3-uniform hypergraphs
A hypergraph is $c$ -sparse if every vertex subset $S$ spans at most $c|S|^2$ edges. Let $(H)$ denote the independence number of a hypergraph $H$ , and let $N$ be the number of verti…
Conjectureopenextremal-combinatorics hypergraph-independence sparse-hypergraphsarXiv posted 2 days ago

de Caen's conjecture on independence numbers of sparse 3-uniform hypergraphs