Large disjoint subgraphs with the same order and size

DOI10.1016/J.EJC.2008.09.001zbMATH Open1200.05111OpenAlexW2084481934MaRDI QIDQ1024273FDOQ1024273

Authors: Yair Caro, Raphael Yuster 

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

Recommendations

• Disjoint induced subgraphs of the same order and size
• Large induced subgraphs with equated maximum degree
• Isomorphic edge disjoint subgraphs of hypergraphs
• Self-similarity of graphs
• scientific article

zbMATH Keywords

chromatic numberKneser graphvertex disjoint subgraphs

Mathematics Subject Classification ID

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

Cites Work

• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Kneser's conjecture, chromatic number, and homotopy
• The Chromatic Number of Kneser Hypergraphs
• The exact bound in the Erdős-Ko-Rado theorem
• On the chromatic number of the general Kneser-graph

Cited In (8)

• Disjoint subgraphs of large maximum degree
• Large induced subgraphs with equated maximum degree
• Disjoint induced subgraphs of the same order and size
• Self-similarity of graphs
• Title not available (Why is that?)
• Order of the largest Sachs subgraphs in graphs
• Twins in graphs
• On homometric sets in graphs

This page was built for publication: Large disjoint subgraphs with the same order and size

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