A Ramsey-type theorem for multiple disjoint copies of induced subgraphs

DOI10.7151/DMGT.1729zbMath1290.05110OpenAlexW2073619342MaRDI QIDQ2450124

Tomoki Nakamigawa

Publication date: 16 May 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1729

zbMATH Keywords

induced subgraphgraph decompositionextremal graph theorygraph Ramsey theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• On Ramsey numbers for large disjoint unions of graphs
• Ramsey Theorems for Multiple Copies of Graphs
• Vertex disjoint equivalent subgraphs of order 3

This page was built for publication: A Ramsey-type theorem for multiple disjoint copies of induced subgraphs