On uncrowded hypergraphs
Richard A. Duke, Hanno Lefmann, Vojtěch Rödl · Random Structures and Algorithms · 1995
Abstract In this note we will show that every k—uniform hypergraph ℋ︁ on n vertices with average degree ik‐1 containing no 2—cycles has independence number α(ℋ︁)≧ck n/t(lnt)1/(k‐1) for t ≧ t0(k). This confirms a conjecture of Spencer. © 1995 John Wiley & Sons, Inc.