Polychromatic cliques

DOI10.1016/j.disc.2004.02.013zbMath1044.05051OpenAlexW4210323931MaRDI QIDQ1877677

Juan José Montellano-Ballesteros, Pavol Hell

Publication date: 19 August 2004

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

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

zbMATH Keywords

CliqueAnti-RamseyPolychromaticSub-Ramsey number

Mathematics Subject Classification ID

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

Related Items (6)

Sub-Ramsey numbers for matchings ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Monochromatic subgraphs in the absence of a properly colored 4-cycle ⋮ The strength of the rainbow Ramsey Theorem ⋮ Comparisons of Polychromatic and Monochromatic Ramsey Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polychromatic Hamilton cycles
• On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
• A new extremal property of Steiner triple-systems
• Union-free families of sets and equations over fields
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• More star sub-Ramsey numbers
• Multicoloured Hamilton cycles
• Multicolored subsets in colored hypergraphs
• Extensions of Turán's theorem on graphs

This page was built for publication: Polychromatic cliques