Ramsey numbers for tournaments

DOI10.1016/S0304-3975(00)00232-2zbMath0998.05045OpenAlexW2093600717MaRDI QIDQ5941503

Yannis Manoussakis, Zsolt Tuza

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00232-2

zbMATH Keywords

Ramsey numbertournamentacyclic digraphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of large uniform hypergraphs
• Largest digraphs contained in all n-tournaments
• Graph coloring in linear time
• Decompositions of partially ordered sets into chains and antichains of given size
• Realization of certain generalized paths in tournaments
• On claws belonging to every tournament
• Antidirected Hamiltonian circuits in tournaments
• Some Ramsey nu mbers for directed graphs
• Ramsey-remainder
• Monochromatic paths in edge-colored graphs
• Antidirected Hamilton circuits and paths in tournaments
• Parity of paths and circuits in tournaments
• A Ramsey-type problem in directed and bipartite graphs
• Paths and Cycles in Tournaments
• A Problem on Tournaments
• Nombre chromatique et plus longs chemins d'un graphe
• Disproof of a conjecture of Erdös and moser on tournaments
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Trees in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: Ramsey numbers for tournaments