# Counting independent sets in hypergraphs

@article{Cooper2014CountingIS, title={Counting independent sets in hypergraphs}, author={Jeff Cooper and Kunal Dutta and Dhruv Mubayi}, journal={Combinatorics, Probability & Computing}, year={2014}, volume={23}, pages={539-550} }

- Published 2014 in Combinatorics, Probability & Computing
DOI:10.1017/S0963548314000182

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

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

## On the Average Size of Independent Sets in Triangle-free Graphs

View 6 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 17 references

## On Uncrowded Hypergraphs

View 7 Excerpts

Highly Influenced

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

View 4 Excerpts

Highly Influenced

## Extremal Uncrowded Hypergraphs

View 7 Excerpts

Highly Influenced

## Graph colouring and the probabilistic method

## On The Number of Partial Steiner Systems

View 1 Excerpt