Combinatorics Probability Computing· 2012Q1
The Size of a Hypergraph and its Matching Number
- 139citations
- Q1SCImago
- 2012year
Short summary
Erdős's hypergraph conjecture is proven for $t < n/(3k^2)$, improving the prior range of $t = O(n/k^3)$.
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