· 2012· Preprint
The number of independent sets in a regular graph
- 104citations
- 2012year
Short summary
The number of independent sets in an N-vertex, d-regular graph is at most (2^(d+1)-1)^(N/2d), a bound sharp for disjoint unions of complete d-regular bipartite graphs. This settles a 1991 conjecture by Alon and a 2001 conjecture by Kahn.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Discrete Mathematics and Combinatorics
Discrete Mathematics and CombinatoricsMathematics