On uncrowded hypergraphs

Authors:
Richard A. Duke;Hanno Lefmann;Vojtech Rödl
Affiliations:
School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332;Universität Dortmund, Fachbereich Informatik, LS II, D—44221 Dortmund, Germany;Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322
Venue:
Random Structures & Algorithms
Year:
1995

Citing 0
Cited 3

Distributions of points in d dimensions and large k-point simplices

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Distributions of points and large quadrangles

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Coloring simple hypergraphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

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.