Erdös-Ko-Rado theorem for ladder graphs
From MaRDI portal
Publication:477467
DOI10.1007/S10255-014-0404-XzbMATH Open1304.05076OpenAlexW875430981MaRDI QIDQ477467FDOQ477467
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
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Extremal set theory (05D05)
Cites Work
Cited In (4)
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)