Proof of the Erdős matching conjecture in a new range

DOI10.1007/s11856-017-1595-7zbMath1376.05122OpenAlexW2767999970WikidataQ123153152 ScholiaQ123153152MaRDI QIDQ1686318

Peter Frankl

Publication date: 21 December 2017

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-017-1595-7

zbMATH Keywords

extremal problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Rainbow version of the Erdős Matching Conjecture via concentration, A Stability Result on Matchings in 3-Uniform Hypergraphs, Families with no perfect matchings, Turán numbers of sunflowers, The Erdős matching conjecture and concentration inequalities, Remarks on the Erdős matching conjecture for vector spaces, On the maximum number of edges in hypergraphs with fixed matching and clique number, The formula for Turán number of spanning linear forests, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Erdős matching conjecture for almost perfect matchings, A proof of Frankl's conjecture on cross-union families, Unavoidable hypergraphs, A generalization of Erdős' matching conjecture, On non-trivial families without a perfect matching, Rainbow matchings in k‐partite hypergraphs, On the size of the product of overlapping families, On the rainbow matching conjecture for 3-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• On Erdős' extremal problem on matchings in hypergraphs
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Maximal number of subsets of a finite set No k of which are pairwise disjoint