THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
From MaRDI portal
Publication:3755479
Recommendations
Cited in
(15)- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- A note on non-empty cross-intersecting families
- A refined result on cross-intersecting families
- Improved bounds on the maximum diversity of intersecting families
- Analogues of Katona's and Milner's theorems for two families
- Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- On the size of shadow-added intersecting families
- Diversity
- A size-sensitive inequality for cross-intersecting families
- A product version of the Hilton-Milner theorem
- Improved bounds concerning the maximum degree of intersecting hypergraphs
- On the maximum number of edges in hypergraphs with fixed matching and clique number
- Stabilities for non-uniform \(t\)-intersecting families
- Erdős-Ko-Rado theorem with conditions on the maximal degree
This page was built for publication: THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755479)