Tiling edge-coloured graphs with few monochromatic bounded-degree graphs

MaRDI QIDQ6621182FDO

Authors Jan Corsten, Walner Mendonça

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

zbMATH Keywords

tilingvertex-partitioning

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
• Monochromatic bounded degree subgraph partitions
• Partitioning by monochromatic trees
• On a tiling conjecture of Komlós for 3-chromatic graphs.

Cites work

• An improved bound for the monochromatic cycle partition number
• Blow-up lemma
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Monochromatic bounded degree subgraph partitions
• Monochromatic cycle power partitions
• On graphs with linear Ramsey numbers
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Ramsey numbers of degenerate graphs
• Vertex coverings by monochromatic cycles and trees

Cited in

(1)

• Tiling edge-coloured graphs with few monochromatic bounded-degree graphs

This page was built for publication: Tiling edge-coloured graphs with few monochromatic bounded-degree graphs

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