Large disjoint subgraphs with the same order and size

DOI10.1016/j.ejc.2008.09.001zbMath1200.05111OpenAlexW2084481934MaRDI QIDQ1024273

Raphael Yuster, Yair Caro

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.001

zbMATH Keywords

chromatic numberKneser graphvertex disjoint subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Twins in graphs ⋮ On homometric sets in graphs ⋮ Large induced subgraphs with equated maximum degree ⋮ Disjoint induced subgraphs of the same order and size

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• The exact bound in the Erdős-Ko-Rado theorem
• On the chromatic number of the general Kneser-graph
• The Chromatic Number of Kneser Hypergraphs