Properly edge-coloured subgraphs in colourings of bounded degree

DOI10.1007/s00373-010-0970-5zbMath1244.05093OpenAlexW2000290050MaRDI QIDQ659683

Peter Wagner, Andrew G. Thomason, Klas Markström

Publication date: 24 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0970-5

zbMATH Keywords

rainbowcanonical Ramsey theoremproperly edge-coloured

Mathematics Subject Classification ID

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

Related Items (1)

Complete graphs and complete bipartite graphs without rainbow path

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey numbers for local colorings
• On Erdős-Rado numbers
• What we know and what we do not know about Turán numbers
• Complete graphs with no rainbow path
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• Edge colorings of complete graphs without tricolored triangles
• Constrained Ramsey numbers of graphs
• An Upper Bound for Constrained Ramsey Numbers
• Transitiv orientierbare Graphen
• A Combinatorial Theorem

This page was built for publication: Properly edge-coloured subgraphs in colourings of bounded degree