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

DOI10.7151/DMGT.1729MaRDI QIDQ2450124zbMATH OpenOpenAlexFDO

Authors Tomoki Nakamigawa

Publication date 16 May 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

extremal graph theorygraph decompositiongraph Ramsey theoryinduced subgraph

Mathematics Subject Classification ID

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

Recommendations

• Vertex disjoint equivalent subgraphs of order 3
• Disjoint stars and forbidden subgraphs
• Ramsey Theorems for Multiple Copies of Graphs
• On induced Ramsey numbers for multiple copies of graphs
• scientific article; zbMATH DE number 2202192

Cites work

• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• On Ramsey numbers for large disjoint unions of graphs
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• Ramsey Theorems for Multiple Copies of Graphs
• Vertex disjoint equivalent subgraphs of order 3

Cited in

(3)

• scientific article; zbMATH DE number 4156484 (Why is no real title available?)
• On cliques and bicliques
• Vertex disjoint equivalent subgraphs of order 3

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

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