The Erdős matching conjecture and concentration inequalities
From MaRDI portal
Publication:2171025
DOI10.1016/J.JCTB.2022.08.002zbMath1497.05253arXiv1806.08855OpenAlexW4293004844MaRDI QIDQ2171025
Andrey B. Kupavskii, Peter Frankl
Publication date: 23 September 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.08855
Extremal problems in graph theory (05C35) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (26)
Rainbow version of the Erdős Matching Conjecture via concentration ⋮ Matching of Given Sizes in Hypergraphs ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ 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 ⋮ A better bound on the size of rainbow matchings ⋮ Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs ⋮ 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 a Conjecture of Feige for Discrete Log-Concave Distributions ⋮ Trivial colors in colorings of Kneser graphs ⋮ A proof of Frankl–Kupavskii's conjecture on edge‐union condition ⋮ Rainbow matchings in properly-colored hypergraphs ⋮ Unavoidable hypergraphs ⋮ On non-trivial families without a perfect matching ⋮ Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Maximum size of a graph with given fractional matching number ⋮ A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Anti-Ramsey number of matchings in hypergraphs
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- On the maximum number of edges in a hypergraph with given matching number
- Asymptotic behavior of the chromatic index for hypergraphs
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in 4-uniform hypergraphs
- A note on perfect matchings in uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Near perfect coverings in graphs and hypergraphs
- Explicit construction of linear sized tolerant networks
- Shadows and shifting
- The uniformity lemma for hypergraphs
- Families of sets with no matchings of sizes 3 and 4
- Diversity of uniform intersecting families
- Proof of the Erdős matching conjecture in a new range
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variables
- Families with no matchings of size \(s\)
- New inequalities for families without \(k\) pairwise disjoint members
- Matchings in 3-uniform hypergraphs
- Best possible bounds on the number of distinct differences in intersecting families
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- On Erdős' extremal problem on matchings in hypergraphs
- Weighted sums of certain dependent random variables
- Fractional and integer matchings in uniform hypergraphs
- On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
- The Size of a Hypergraph and its Matching Number
- Recent advances on Dirac-type problems for hypergraphs
- Bounding Probability of Small Deviation: A Fourth Moment Approach
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
- Bounds for the Distribution Function of a Sum of Independent, Identically Distributed Random Variables
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Degrees giving independent edges in a hypergraph
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- On the Shannon capacity of a graph
- Rainbow matchings in k‐partite hypergraphs
- Simple juntas for shifted families
- Rainbow structures in locally bounded colorings of graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Families with no s pairwise disjoint sets
- On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
- On a Chebyshev-Type Inequality for Sums of Independent Random Variables
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- Rainbow version of the Erdős Matching Conjecture via concentration
- Diversity
This page was built for publication: The Erdős matching conjecture and concentration inequalities
