Improved bounds for Erdős' matching conjecture

DOI10.1016/j.jcta.2013.01.008zbMath1277.05123OpenAlexW7943539WikidataQ122894276 ScholiaQ122894276MaRDI QIDQ385035

Publication date: 29 November 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2013.01.008

zbMATH Keywords

hypergraphs matching number Erdős conjecture Katona's theorem on shadows of intersecting hypergraphs

Mathematics Subject Classification ID

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

Related Items

A note on exact minimum degree threshold for fractional perfect matchings, Erdős-Ko-Rado type theorems for simplicial complexes, Rainbow version of the Erdős Matching Conjecture via concentration, A Stability Result on Matchings in 3-Uniform Hypergraphs, The $(p, q)$-extremal problem and the fractional chromatic number of Kneser hypergraphs, Size and structure of large $(s,t)$-union intersecting families, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, A note on fractional covers of a graph, Turán numbers of sunflowers, Fractional and integer matchings in uniform hypergraphs, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, On the sum of sizes of overlapping families, Sharp bounds for the chromatic number of random Kneser graphs, The Erdős matching conjecture and concentration inequalities, Remarks on the Erdős matching conjecture for vector spaces, Rainbow Perfect Matchings for 4-Uniform Hypergraphs, Stability results for vertex Turán problems in Kneser graphs, On the maximum number of edges in hypergraphs with fixed matching and clique number, On the size of 3-uniform linear hypergraphs, On vertex independence number of uniform hypergraphs, Proof of the Erdős matching conjecture in a new range, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, On maximal tail probability of sums of nonnegative, independent and identically distributed random variables, Turán numbers for disjoint paths, Structure and supersaturation for intersecting families, A degree version of the Hilton-Milner theorem, Extremal Problem for Matchings and Rainbow Matchings on Direct Products, On families with bounded matching number, Improved bound on vertex degree version of Erdős matching conjecture, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Families with no matchings of size $s$, The junta method in extremal hypergraph theory and Chvátal's conjecture, A better bound on the size of rainbow matchings, Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs, Intersection theorems for multisets, Ramsey-Turán type results for matchings in edge colored graphs, Erdős matching conjecture for almost perfect matchings, Families with restricted matching number and multiply covered shadows, A proof of Frankl's conjecture on cross-union families, On Rainbow Matchings for Hypergraphs, Stability for vertex isoperimetry in the cube, A short proof of Erdős' conjecture for triple systems, Unnamed Item, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, Hypergraph Turán numbers of linear cycles, The structure of large intersecting families, The maximum number of cliques in hypergraphs without large matchings, Intersections and distinct intersections in cross-intersecting families, The size of 3-uniform hypergraphs with given matching number and codegree, On a biased edge isoperimetric inequality for the discrete cube, Generalization of Erdős-Gallai edge bound, On the random version of the Erdős matching conjecture, Non-trivial $d$-wise intersecting families, Structure of the largest subgraphs of $G_{n , p}$ with a given matching number, On the size of shadow-added intersecting families, $H$-decomposition of $r$-graphs when $H$ is an $r$-graph with exactly $k$ independent edges, Random Kneser graphs and hypergraphs, Rainbow matchings in properly-colored hypergraphs, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Unavoidable hypergraphs, On the maximum number of edges in a hypergraph with given matching number, A generalization of Erdős' matching conjecture, The minimum number of disjoint pairs in set systems and related problems, On non-trivial families without a perfect matching, Erdős-Ko-Rado theorems on the weak Bruhat lattice, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, On the maximum size of subfamilies of labeled set with given matching number, Extremal $G$-free induced subgraphs of Kneser graphs, Linear trees in uniform hypergraphs, Beyond the Erdős matching conjecture, Old and new applications of Katona's circle, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, Simple juntas for shifted families, Rainbow matchings for 3-uniform hypergraphs, Invitation to intersection problems for finite sets, On the arithmetic mean of the size of cross-union families, Tight bounds for Katona's shadow intersection theorem, On the union of intersecting families, Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman, Hypergraphs Not Containing a Tight Tree with a Bounded Trunk, Nearly Perfect Matchings in Uniform Hypergraphs, Degree versions of theorems on intersecting families via stability, Rainbow matchings in k‐partite hypergraphs, On the size of the product of overlapping families, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, Maximum size of a graph with given fractional matching number, On the rainbow matching conjecture for 3-uniform hypergraphs, On the bandwidth of the Kneser graph

Cites Work