Monochromatic trees in random tournaments

DOI10.1017/S0963548319000373zbMath1466.05033arXiv1809.07089OpenAlexW3102547968WikidataQ126831918 ScholiaQ126831918MaRDI QIDQ4993096

Sven Heberle, Shoham Letzter, Matija Bucić, Benjamin Sudakov

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.07089

zbMATH Keywords

random tournament2-edge-colouring

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Monochromatic paths in random tournaments ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two problems in graph Ramsey theory
• The size Ramsey number of a directed path
• The Ramsey number of a graph with bounded maximum degree
• Ramsey numbers for sparse graphs
• Monochromatic paths in random tournaments
• Some Ramsey nu mbers for directed graphs
• A Ramsey-type problem for paths in digraphs
• Sur le circuit hamiltonien bi-colore dans les graphes orientes
• A Ramsey-type problem in directed and bipartite graphs
• On graphs with linear Ramsey numbers
• Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph
• Nombre chromatique et plus longs chemins d'un graphe
• Directed Ramsey number for trees
• Testing subgraphs in directed graphs

This page was built for publication: Monochromatic trees in random tournaments