Regular bipartite graphs and intersecting families
From MaRDI portal
Abstract: In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the ErdH os--Ko--Rado theorem, the Hilton--Milner theorem, a theorem due to Frankl concerning the size of intersecting families with bounded maximal degree, and versions of results on the sum of sizes of non-empty cross-intersecting families due to Frankl and Tokushige. Several new stronger results are also obtained. Our approach is based on the use of regular bipartite graphs. These graphs are quite often used in Extremal Set Theory problems, however, the approach we develop proves to be particularly fruitful.
Recommendations
Cites work
- A new generalization of the Erdős-Ko-Rado theorem
- A size-sensitive inequality for cross-intersecting families
- Counting intersecting and pairs of cross-intersecting families
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Non-trivial intersecting families
- Some best possible inequalities concerning cross-intersecting families
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The unbalance of set systems
Cited in
(46)- Intersection numbers of bipartite distance-regular graphs
- Diversity of uniform intersecting families
- A semidefinite programming approach to a cross-intersection problem with measures
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Non-trivially intersecting multi-part families
- On the chromatic numbers of some distance graphs
- On the random version of the Erdős matching conjecture
- The Cayley isomorphism property for Cayley maps
- Coloring cross-intersecting families
- Nontrivial independent sets of bipartite graphs and cross-intersecting families
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Sharp results concerning disjoint 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
- Best possible bounds on the number of distinct differences in intersecting families
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- On a Frankl-Wilson theorem
- A generalization of Kneser graphs
- Stability for vertex isoperimetry in the cube
- On the number of distinct differences in an intersecting family
- 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\)
- Degree versions of theorems on intersecting families via stability
- Regular intersecting families
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- A simple proof of the Hilton-Milner theorem
- Almost intersecting families
- Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- Extremal problems in hypergraph colourings
- scientific article; zbMATH DE number 7085085 (Why is no real title available?)
- Diversity
- Uniform intersecting families with large covering number
- Improved bounds on the maximum diversity of intersecting families
- A generalization of diversity for intersecting families
- Sharp bounds for the chromatic number of random Kneser graphs
- The maximum of the product of nontrivial cross-intersecting 3-graphs
- Intersecting families with covering number 3
- On the C-diversity of intersecting k-graphs
- Maximal intersecting families revisited
- A result for hemi-bundled cross-intersecting families
- Proof of Frankl's conjecture on cross-intersecting families
- Structure of non-trivial intersecting families
- Best possible bounds on the double-diversity of intersecting hypergraphs
- Maximum degree and diversity in intersecting hypergraphs
This page was built for publication: Regular bipartite graphs and intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689040)
