Erdös-Ko-Rado theorem for ladder graphs

DOI10.1007/S10255-014-0404-XMaRDI QIDQ477467zbMATH OpenOpenAlexFDO

Authors 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

ladder graphintersecting familyErdős-Ko-Rado (EKR) theorem

Mathematics Subject Classification ID

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

Recommendations

• Erdős-Ko-Rado theorems for chordal graphs and trees
• scientific article; zbMATH DE number 5130735
• Graphs with the Erdős-Ko-Rado property
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• scientific article; zbMATH DE number 4160763
• An Erdős-Ko-Rado theorem for matchings in the complete graph
• A generalization of the Erdős-Ko-Rado theorem
• A generalization of the Erdős-Ko-Rado theorem
• Kirszbraun-type theorems for graphs

Cites work

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

Cited in

(4)

• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• On the Edge-Erdős–Pósa Property of Ladders
• Graphs with the Erdős-Ko-Rado property
• Very well-covered graphs with the Erdős-Ko-Rado property

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477467)