Improved bounds for Erdős' matching conjecture

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

Cites Work

On maximal paths and circuits of graphs
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
On the maximum number of edges in a triple system not containing a disjoint family of a given size
Intersection theorems for systems of finite sets
Title not available (Why is that?)
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Title not available (Why is that?)
The size of a hypergraph and its matching number
SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
Nonnegative $k$-sums, fractional covers, and probability of small deviations
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
On matchings in hypergraphs
Title not available (Why is that?)

Cited In (94)

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

   Recommendations

This page was built for publication: Improved bounds for Erdős' matching conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385035)