Sparse hypergraphs with low independence number
Sign Up to like & getrecommendations! Published in 2017 at "Combinatorica"
DOI: 10.1007/s00493-014-3219-8
Abstract: AbstractLet K4(3) denote the complete 3-uniform hypergraph on 4 vertices. Ajtai, Erdős, Komlós, and Szemerédi (1981) asked if there is a function ω(d)→∞ such that every 3-uniform, K4(3)-free hypergraph H with N vertices and average… read more here.
Keywords: hypergraph; hypergraphs low; independence number; sparse hypergraphs ... See more keywords