Decompositions of edge-colored infinite complete graphs into monochromatic paths

DOI10.1016/j.disc.2016.09.028zbMath1362.05102arXiv1502.04955OpenAlexW2963423082MaRDI QIDQ2397547

Zoltán Szentmiklóssy, Dániel T. Soukup, Lajos Soukup, Márton Elekes

Publication date: 22 May 2017

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

Full work available at URL: https://arxiv.org/abs/1502.04955

zbMATH Keywords

edge coloringgraph partitionmonochromatic pathcomplete hypergraphinfinite complete graphpath squareuncountable complete graph

Mathematics Subject Classification ID

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

Related Items (14)

Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Decompositions of edge-colored infinite complete graphs into monochromatic paths ⋮ Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Ramsey upper density of infinite graph factors ⋮ Problems close to my heart ⋮ Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Partitioning random graphs into monochromatic components ⋮ Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs ⋮ The Rado path decomposition theorem ⋮ Ramsey theory for highly connected monochromatic subgraphs ⋮ Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Combinatorial set theory: Partition relations for cardinals
• Vertex coverings by monochromatic cycles and trees
• Monochromatic path and cycle partitions in hypergraphs
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Calculating Ramsey Numbers by Partitioning Colored Graphs
• Monochromatic Paths in Graphs

This page was built for publication: Decompositions of edge-colored infinite complete graphs into monochromatic paths