Annals of Mathematics· 2016Q1
Combinatorial theorems in sparse random sets
- 179citations
- Q1SCImago
- 2016year
Short summary
A new technique unifies proofs showing that major combinatorial theorems, like Turán's and Ramsey's, hold true in sparse random sets.
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