Regular bipartite graphs and intersecting families
From MaRDI portal
Publication:1689040
DOI10.1016/j.jcta.2017.11.006zbMath1377.05190arXiv1611.03129OpenAlexW2963619827MaRDI QIDQ1689040
Dmitriy Zakharov, Andrey B. Kupavskii
Publication date: 12 January 2018
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03129
Related Items
Almost intersecting families, Diversity of uniform intersecting families, A simple proof of the Hilton-Milner theorem, Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors, On a Frankl-Wilson theorem, A generalization of Kneser graphs, Extremal problems in hypergraph colourings, Uniform intersecting families with large covering number, Improved bounds on the maximum diversity of intersecting families, Stability for vertex isoperimetry in the cube, Non-trivially intersecting multi-part families, Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems, On the chromatic numbers of some distance graphs, On the number of distinct differences in an intersecting family, On the random version of the Erdős matching conjecture, Diversity, Sharp results concerning disjoint cross-intersecting families, The Cayley isomorphism property for Cayley maps, Coloring cross-intersecting families, Old and new applications of Katona's circle, Minimum degree and diversity in intersecting antichains, On the arithmetic mean of the size of cross-union families, On strengthenings of the intersecting shadow theorem, Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman, On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\), Maximum degree and diversity in intersecting hypergraphs, Degree versions of theorems on intersecting families via stability, Best possible bounds on the number of distinct differences in intersecting families, Regular intersecting families, Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A size-sensitive inequality for cross-intersecting families
- The unbalance of set systems
- Non-trivial intersecting families
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Some best possible inequalities concerning cross-intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Counting Intersecting and Pairs of Cross-Intersecting Families
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A new generalization of the Erdős-Ko-Rado theorem
