Counting independent sets in hypergraphs

  title={Counting independent sets in hypergraphs},
  author={Jeff Cooper and Kunal Dutta and Dhruv Mubayi},
  journal={Combinatorics, Probability & Computing},
Let G be a triangle-free graph with n vertices and average degree t. We show that G contains at least e(1−n −1/12) 1 2 n t ln t( 1 2 ln t−1) independent sets. This improves a recent result of the first and third authors [8]. In particular, it implies that as n→∞, every triangle-free graph on n vertices has at least e(c1−o(1)) √ n lnn independent sets, where c1 = √ ln 2/4 = 0.208138... Further, we show that for all n, there exists a triangle-free graph with n vertices which has at most e(c2+o(1… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 3 times. VIEW TWEETS

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 17 references

On Uncrowded Hypergraphs

Random Struct. Algorithms • 1995
View 7 Excerpts
Highly Influenced

The Ramsey Number R(3, t) Has Order of Magnitude t2/log t

Random Struct. Algorithms • 1995
View 4 Excerpts
Highly Influenced

Extremal Uncrowded Hypergraphs

View 7 Excerpts
Highly Influenced

Graph colouring and the probabilistic method

Michael Molloy, Bruce Reed
Algorithms and Combinatorics, • 2002

Vu , Concentration of multivariate polynomials and its applications

Jeong Han Kim, H. Van
Combinatorica • 2000

Phelps , Random methods in design theory : a survey

Gonzalo Fiz Pontiveros, David A. Grable, T. Kevin
J . Combin . Des . • 1996

Similar Papers

Loading similar papers…