THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS

DOI10.1093/QMATH/37.4.385zbMATH Open0619.05037OpenAlexW2044387656MaRDI QIDQ3755479FDOQ3755479

Authors: Ian Anderson, A. J. W. Hilton 

Publication date: 1986

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/37.4.385

Recommendations

• Erdős-Ko-Rado theorem with conditions on the maximal degree
• scientific article; zbMATH DE number 3900758
• Erdős-Ko-Rado theorem for a restricted universe
• scientific article; zbMATH DE number 3991507
• Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem

zbMATH Keywords

Hilton-Milner theoremErdős-Ko-Rado theoremk-uniformk-uniform familiesvalency conditions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cited In (15)

• A refined result on cross-intersecting families
• A note on non-empty cross-intersecting families
• Improved bounds concerning the maximum degree of intersecting hypergraphs
• Erdős-Ko-Rado with conditions on the minimum complementary degree
• Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
• Stabilities for non-uniform \(t\)-intersecting families
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• A product version of the Hilton-Milner theorem
• Improved bounds on the maximum diversity of intersecting families
• Diversity
• On the size of shadow-added intersecting families
• On the maximum number of edges in hypergraphs with fixed matching and clique number
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Analogues of Katona's and Milner's theorems for two families
• A size-sensitive inequality for cross-intersecting families

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)