Results 1 
1 of
1
Sparse hypergraphs with low independence number
, 2014
"... ... denote the complete 3uniform hypergraph on 4 vertices. Ajtai, Erdős, Komlós, and Szemerédi (1981) asked if there is a function ω(d) → ∞ such that every 3uniform, K (3) 4free hypergraph H with N vertices and average degree d has independence number at least N d1/2 ω(d). We answer this que ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
... denote the complete 3uniform hypergraph on 4 vertices. Ajtai, Erdős, Komlós, and Szemerédi (1981) asked if there is a function ω(d) → ∞ such that every 3uniform, K (3) 4free hypergraph H with N vertices and average degree d has independence number at least N d1/2 ω(d). We answer this question by constructing a 3uniform, K (3)