Journal of the American Mathematical Society· 2014Q1
Independent sets in hypergraphs
- 344citations
- Q1SCImago
- 2014year
Short summary
A new, distinct approach to proving extremal and structural results in sparse random hypergraphs is introduced, yielding 'counting' versions of these theorems.
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