On the random version of the Erdős matching conjecture
From MaRDI portal
Publication:1720300
DOI10.1016/j.dam.2018.06.024zbMath1404.05162arXiv1802.09871OpenAlexW2964190077WikidataQ123018475 ScholiaQ123018475MaRDI QIDQ1720300
Ali Taherkhani, Meysam Alishahi
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09871
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- On random subgraphs of Kneser and Schrijver graphs
- Improved bounds for Erdős' matching conjecture
- On matchings in hypergraphs
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- On the stability of the Erdös-Ko-Rado theorem
- On the stability of some Erdős-Ko-Rado type results
- On random subgraphs of Kneser graphs and their generalizations
- On the maximum number of edges in a hypergraph with given matching number
- The minimum number of disjoint pairs in set systems and related problems
- On the chromatic number of a random subgraph of the Kneser graph
- On the stability of the Erdős-Ko-Rado theorem
- Families of sets with no matchings of sizes 3 and 4
- Chromatic number of random Kneser hypergraphs
- Regular bipartite graphs and intersecting families
- A degree version of the Hilton-Milner theorem
- On the stability of the independence number of a random subgraph
- On Erdős' extremal problem on matchings in hypergraphs
- Removal and Stability for Erdös--Ko--Rado
- On “stability” in the Erdös--Ko--Rado Theorem
- The Size of a Hypergraph and its Matching Number
- On maximal paths and circuits of graphs
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
