Monochromatic subgraphs in the absence of a properly colored 4-cycle

DOI10.1007/s00373-018-1955-zzbMath1402.05075OpenAlexW2896391094MaRDI QIDQ1756081

Pouria Salehi Nowbandegani, Daniel M. Martin, Colton Magnant

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1955-z

zbMATH Keywords

proper cycleedge-coloring forbidden colored subgraphproper-Ramsey

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (2)

Edge‐colored complete graphs without properly colored even cycles: A full characterization ⋮ Properly colored \(C_4\)'s in edge-colored graphs

Cites Work

• Unnamed Item
• Gallai-Ramsey numbers for cycles
• Rainbow generalizations of Ramsey theory: A survey
• Note on highly connected monochromatic subgraphs in 2-colored complete graphs
• Polychromatic cliques
• Structure of colored complete graphs free of proper cycles
• Disconnected Colors in Generalized Gallai-Colorings
• Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
• Extensions of Gallai-Ramsey results
• Lambda composition
• Edge colorings of complete graphs without tricolored triangles
• Constrained Ramsey numbers of graphs
• Transitiv orientierbare Graphen

This page was built for publication: Monochromatic subgraphs in the absence of a properly colored 4-cycle