Vertex partition of a complete multipartite graph into two kinds of induced subgraphs

DOI10.1016/j.disc.2010.02.012zbMath1222.05214OpenAlexW2039641617MaRDI QIDQ973113

Tomoki Nakamigawa

Publication date: 28 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.02.012

zbMATH Keywords

vertex partitiongraph decompositioncomplete multipartite graphgraph Ramsey theorycoin problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)

Related Items (1)

An extremal problem for vertex partition of complete multipartite graphs

Cites Work

• Equivalent subsets of a colored set
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• On Ramsey numbers for large disjoint unions of graphs
• A partition problem on colored sets
• Ramsey Theorems for Multiple Copies of Graphs
• Vertex disjoint equivalent subgraphs of order 3

This page was built for publication: Vertex partition of a complete multipartite graph into two kinds of induced subgraphs