Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
From MaRDI portal
Publication:2312621
DOI10.1016/j.jctb.2019.02.004zbMath1415.05175arXiv1607.06126OpenAlexW2963651820MaRDI QIDQ2312621
Andrey B. Kupavskii, Peter Frankl
Publication date: 17 July 2019
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06126
stabilityextremal set theoryfamilies of setsErdős matching conjectureKleitman's problemanti-Ramsey-type problems
Related Items
Stability on matchings in 3-uniform hypergraphs, Rainbow version of the Erdős Matching Conjecture via concentration, A Stability Result on Matchings in 3-Uniform Hypergraphs, Size and structure of large \((s,t)\)-union intersecting families, Rainbow matchings in an edge-colored planar bipartite graph, Exact rainbow numbers for matchings in plane triangulations, Sharp bounds for the chromatic number of random Kneser graphs, The Erdős matching conjecture and concentration inequalities, Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, On families with bounded matching number, Anti-Ramsey number of matchings in outerplanar graphs, Families with restricted matching number and multiply covered shadows, Anti-Ramsey number of disjoint union of star-like hypergraphs, On the size of shadow-added intersecting families, On stability of the independence number of a certain distance graph, Anti-Ramsey number of matchings in a hypergraph, On families of sets without \(k\) pairwise disjoint members, Rainbow numbers for paths in planar graphs, New inequalities for families without \(k\) pairwise disjoint members, Extremal set theory for the binomial norm, On non-trivial families without a perfect matching, Beyond the Erdős matching conjecture, Old and new applications of Katona's circle, Rainbow numbers for small graphs in planar graphs, Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs, Families of finite sets satisfying intersection restrictions, Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs, Degree versions of theorems on intersecting families via stability
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Anti-Ramsey number of matchings in hypergraphs
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- On matchings in hypergraphs
- On the maximum number of edges in a hypergraph with given matching number
- Families of sets with no matchings of sizes 3 and 4
- Regular bipartite graphs and intersecting families
- Families with no matchings of size \(s\)
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- New inequalities for families without \(k\) pairwise disjoint members
- The Erdős matching conjecture and concentration inequalities
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- On Erdős' extremal problem on matchings in hypergraphs
- The Size of a Hypergraph and its Matching Number
- Recent advances on Dirac-type problems for hypergraphs
- The structure of large intersecting families
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Partition‐free families of sets
- Families with no s pairwise disjoint sets
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
