An extremal problem for vertex partition of complete multipartite graphs

DOI10.1016/J.DISC.2016.01.012zbMATH Open1333.05244OpenAlexW2284652046MaRDI QIDQ267182FDOQ267182

Authors: 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

Recommendations

• Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
• Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs
• Edge decomposition of complete tripartite graphs
• An unusual decomposition of a complete 7-partite graph of order 28
• scientific article; zbMATH DE number 2094440

zbMATH Keywords

extremal graph theorygraph decompositiongraph 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

• Packing problems in edge-colored graphs
• Title not available (Why is that?)
• Equivalent subsets of a colored set
• Vertex partition of a complete multipartite graph into two kinds of induced subgraphs

Cited In (5)

• On vertex stability of complete k-partite graphs
• Title not available (Why is that?)
• Minimization and parameterized variants of vertex partition problems on graphs
• Solution of one problem of optimal partition of the vertex set of a hypergraph
• Vertex partitions and maximum degenerate subgraphs

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

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