Monochromatic square-cycle and square-path partitions

DOI10.1016/J.DISC.2021.112712MaRDI QIDQ2065889zbMATH OpenOpenAlexFDO

Authors Gábor N. Sárközy

Publication date 13 January 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

monochromatic partitionssquare cyclessquare paths

Mathematics Subject Classification ID

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

Recommendations

• Monochromatic cycle power partitions
• Partitioning 3-coloured complete graphs into three monochromatic paths
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths

Cites work

• Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
• An algorithmic version of the blow-up lemma
• An extension of the blow-up lemma to arrangeable graphs
• An improved bound for the monochromatic cycle partition number
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
• Blow-up lemma
• Calculating Ramsey numbers by partitioning colored graphs
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Hamiltonian square-paths
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 15152 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1286511 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• Improved monochromatic loose cycle partitions in hypergraphs
• Local colourings and monochromatic partitions in complete bipartite graphs
• Minimum degree conditions for monochromatic cycle partitioning
• Monochromatic bounded degree subgraph partitions
• Monochromatic cycle partitions in local edge colorings
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
• Monochromatic cycle partitions of edge-colored graphs
• Monochromatic cycle partitions of graphs with large minimum degree
• Monochromatic cycle power partitions
• Monochromatic partitions in local edge colorings
• Monochromatic path and cycle partitions in hypergraphs
• On the square of a Hamiltonian cycle in dense graphs
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning complete bipartite graphs by monochromatic cycles
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Proof of the Seymour conjecture for large graphs
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• Ramsey-goodness -- and otherwise
• The Square of a Hamiltonian Cycle
• The square of paths and cycles
• Three-color Ramsey numbers for paths
• Vertex coverings by monochromatic cycles and trees
• Vertex partitions by connected monochromatic k-regular graphs

Cited in

(1)

• Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles

This page was built for publication: Monochromatic square-cycle and square-path partitions

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