Anti-Ramsey colorings in several rounds

DOI10.1006/jctb.2000.2016zbMath1024.05061OpenAlexW2112475468MaRDI QIDQ1850529

Miklós Ruszinkó, Ralph J. Faudree, Aart Blokhuis, András Gyárfás

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/735956a1afac7a9df5a9b666eac1c982e0db7464

Mathematics Subject Classification ID

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

Related Items (5)

Improved approximation for maximum edge colouring problem ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Two orthogonal 4-cycle-free one-factorizations of complete graphs ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On restricted colourings of \(K_ n\)
• New bounds for perfect hashing via information theory
• On the Size of Separating Systems and Families of Perfect Hash Functions
• One-factorizations of the complete graph—A survey
• On coloring graphs to maximize the proportion of multicolored k-edges

This page was built for publication: Anti-Ramsey colorings in several rounds