Counting independent sets in triangle-free graphs

DOI10.1090/S0002-9939-2014-12068-5zbMath1300.05169arXiv1111.3707MaRDI QIDQ3190316

Dhruv Mubayi, Jeff Cooper

Publication date: 16 September 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.3707

zbMATH Keywords

Ramsey number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Combinatorial probability (60C05) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

On the number of independent sets in simple hypergraphs, Doubly Exponentially Many Ingleton Matroids, On the average size of independent sets in triangle-free graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• The triangle-free process
• An upper bound for the number of independent sets in regular graphs
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• A dense infinite Sidon sequence
• Independent sets in regular graphs and sum-free subsets of finite groups
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The number of cliques in graphs of given order and size
• On the Minimal Density of Triangles in Graphs
• The Number of Independent Sets in a Regular Graph
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On the structure of linear graphs