Erdös-Ko-Rado theorem for ladder graphs

DOI10.1007/s10255-014-0404-xzbMath1304.05076OpenAlexW875430981MaRDI QIDQ477467

Yu-Shuang Li, Hua Jun Zhang

Publication date: 9 December 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-014-0404-x

zbMATH Keywords

intersecting familyladder graphErdős-Ko-Rado (EKR) theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Very well-covered graphs with the Erdős-Ko-Rado property

Cites Work

• Intersecting and cross-intersecting families of labeled sets
• The Erdős-Ko-Rado properties of various graphs containing singletons
• Compression and Erdős-Ko-Rado graphs
• Graphs with the Erdős-Ko-Rado property
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Erdös-Ko-Rado theorem for ladder graphs