Degree versions of theorems on intersecting families via stability
From MaRDI portal
Publication:2326331
DOI10.1016/j.jcta.2019.06.002zbMath1421.05090arXiv1810.00915OpenAlexW2964166146WikidataQ127624242 ScholiaQ127624242MaRDI QIDQ2326331
Publication date: 7 October 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.00915
Related Items (11)
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ On stability of the independence number of a certain distance graph ⋮ Diversity ⋮ Sharp results concerning disjoint cross-intersecting families ⋮ On dividing sets into parts of smaller diameter ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ Minimum degree and diversity in intersecting antichains ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Independence numbers of random subgraphs of distance graphs
- Improved bounds for Erdős' matching conjecture
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- On the stability of some Erdős-Ko-Rado type results
- On random subgraphs of Kneser graphs and their generalizations
- A note on Huang-Zhao theorem on intersecting families with large minimum degree
- On the maximum number of edges in a hypergraph with given matching number
- On the chromatic number of a random subgraph of the Kneser graph
- Invitation to intersection problems for finite sets
- On the stability of the Erdős-Ko-Rado theorem
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Two extremal problems on intersecting families
- Diversity of uniform intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Regular bipartite graphs and intersecting families
- A degree version of the Hilton-Milner theorem
- Non-trivially intersecting multi-part families
- On the stability of the independence number of a random subgraph
- Nontrivial independent sets of bipartite graphs and cross-intersecting families
- Sharp results concerning disjoint cross-intersecting families
- Independence numbers of random subgraphs of some distance graph
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- The maximum sum and the maximum product of sizes of cross-intersecting families
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
- The maximum product of weights of cross-intersecting families
- The structure of large intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Counting Intersecting and Pairs of Cross-Intersecting Families
- Families with no s pairwise disjoint sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: Degree versions of theorems on intersecting families via stability
