Monochromatic paths in random tournaments

DOI10.1016/j.endm.2017.06.036zbMath1378.05078arXiv1703.10424OpenAlexW2922777578WikidataQ130022541 ScholiaQ130022541MaRDI QIDQ1689907

Matija Bucić, Shoham Letzter, Benjamin Sudakov

Publication date: 18 January 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryedge colouringsize Ramsey numberdirected pathsrandom tournamentmonochromatic directed pathmonochromatic oriented path

Mathematics Subject Classification ID

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

Related Items

The oriented size Ramsey number of directed paths ⋮ The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Directed Ramsey number for trees ⋮ Ordered size Ramsey number of paths ⋮ A strengthening of the Erdős-Szekeres theorem ⋮ Monochromatic trees in random tournaments ⋮ The multicolor size-Ramsey numbers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The size Ramsey number of a directed path
• The size Ramsey number
• The Ramsey size number of dipaths
• The oriented size Ramsey number of directed paths
• Sur le circuit hamiltonien bi-colore dans les graphes orientes
• Long cycles in subgraphs of (pseudo)random directed graphs
• On size Ramsey number of paths, trees, and circuits. I
• Vertex coverings by monochromatic paths and cycles
• Monochromatic trees in random tournaments
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I
• Directed Ramsey number for trees