An extremal problem for vertex partition of complete multipartite graphs

DOI10.1016/j.disc.2016.01.012zbMath1333.05244OpenAlexW2284652046MaRDI QIDQ267182

Tomoki Nakamigawa

Publication date: 8 April 2016

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

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

zbMATH Keywords

graph 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)

Cites Work

• Unnamed Item
• Equivalent subsets of a colored set
• Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
• Packing problems in edge-colored graphs

This page was built for publication: An extremal problem for vertex partition of complete multipartite graphs