Monochromatic sinks in nearly transitive arc-colored tournaments

DOI10.1016/j.disc.2010.04.003zbMath1221.05155OpenAlexW2008378335MaRDI QIDQ709318

Michael Melcher, K. Brooks Reid

Publication date: 18 October 2010

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

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

zbMATH Keywords

tournamenttransitive tournamentarc-coloringmonochromatic sinkupset tournament

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Monochromatic sinks in \(k\)-arc colored tournaments ⋮ Domination in transitive colorings of tournaments ⋮ The number of tournaments with the minimum number of upsets ⋮ Unnamed Item ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Short score certificates for upset tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
• Reachability problems in edge-colored digraphs

This page was built for publication: Monochromatic sinks in nearly transitive arc-colored tournaments