Path-monochromatic bounded depth rooted trees in (random) tournaments

DOI10.1016/J.DISC.2024.114022MaRDI QIDQ6494953

Raphael Yuster

Publication date: 30 April 2024

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

zbMATH Keywords

edge coloringtournamentmonochromatic path

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• The size Ramsey number of a directed path
• Near perfect coverings in graphs and hypergraphs
• Directed triangles in digraphs
• On monochromatic paths in edge-coloured digraphs
• A lower bound on the size of an absorbing set in an arc-coloured tournament
• Monochromatic paths in random tournaments
• A proof of the Erdös-Sands-Sauer-Woodrow conjecture
• Monochromatic trees in random tournaments

This page was built for publication: Path-monochromatic bounded depth rooted trees in (random) tournaments