Improved bounds for Erdős' matching conjecture
From MaRDI portal
(Redirected from Publication:385035)
Recommendations
- Improved bound on vertex degree version of Erdős matching conjecture
- A generalization of Erdős' matching conjecture
- Beyond the Erdős matching conjecture
- An improved upper bound for the Erdős-Szekeres conjecture
- Erdős matching conjecture for almost perfect matchings
- Proof of the Erdős matching conjecture in a new range
- The Erdős matching conjecture and concentration inequalities
- Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
- On the random version of the Erdős matching conjecture
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
Cites work
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 863493 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite sets
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- On matchings in hypergraphs
- On maximal paths and circuits of graphs
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The size of a hypergraph and its matching number
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
- On non-trivial families without a perfect matching
- Ramsey-Turán type results for matchings in edge colored graphs
- A stability result on matchings in 3-uniform hypergraphs
- Improved bound on vertex degree version of Erdős matching conjecture
- 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
- Degree versions of theorems on intersecting families via stability
- Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- Simple juntas for shifted families
- Families with no matchings of size s
- Nearly perfect matchings in uniform hypergraphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Linear trees in uniform hypergraphs
- 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
- Perfect matchings in hypergraphs and the Erdős matching conjecture
- On vertex independence number of uniform hypergraphs
- Stability results for vertex Turán problems in Kneser graphs
- Stability for vertex isoperimetry in the cube
- 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
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
- Extremal G-free induced subgraphs of Kneser graphs
- Rainbow matchings in \(k\)-partite hypergraphs
- The size of 3-uniform hypergraphs with given matching number and codegree
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- Remarks on the Erdős matching conjecture for vector spaces
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- On the union of intersecting families
- A better bound on the size of rainbow matchings
- The structure of large intersecting families
- Families with restricted matching number and multiply covered shadows
- A proof of Frankl's conjecture on cross-union families
- Old and new applications of Katona's circle
- Rainbow perfect matchings for 4-uniform hypergraphs
- On families with bounded matching number
- Rainbow matchings for 3-uniform hypergraphs
- On the arithmetic mean of the size of cross-union families
- Some results around the Erdős matching conjecture
- The minimum number of disjoint pairs in set systems and related problems
- Intersection theorems for multisets
- On the bandwidth of the Kneser graph
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- A note on fractional covers of a graph
- 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
- Hypergraph removal lemmas via robust sharp threshold theorems
- On the size of shadow-added intersecting families
- Generalization of Erdős-Gallai edge bound
- 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
- 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
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
- A short proof of Erdős' conjecture for triple systems
- Hypergraphs not containing a tight tree with a bounded trunk
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- On Rainbow Matchings for Hypergraphs
- The maximum number of cliques in hypergraphs without large matchings
- scientific article; zbMATH DE number 7662450 (Why is no real title available?)
- Intersections and distinct intersections in cross-intersecting families
- Invitation to intersection problems for finite sets
- The maximum number of disjoint pairs in a family of subsets
- Non-trivial \(d\)-wise intersecting families
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs
- Hypergraph Turán numbers of linear cycles
- Random Kneser graphs and hypergraphs
- 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
- On the maximum number of edges in a hypergraph with given matching number
- On a biased edge isoperimetric inequality for the discrete cube
- A note on exact minimum degree threshold for fractional perfect matchings
- Rainbow version of the Erdős Matching Conjecture via concentration
- Turán numbers of sunflowers
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)
