Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets

DOI10.1137/15M1043911zbMath1362.05052OpenAlexW2605244699MaRDI QIDQ5346549

Ringi Kim

Publication date: 24 May 2017

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

Full work available at URL: https://doi.org/10.1137/15m1043911

zbMATH Keywords

homogeneous setsRamsey-type theoremprime tournaments

Mathematics Subject Classification ID

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

Related Items (2)

Jónsson posets ⋮ A Ramsey-type theorem for the matching number regarding connected graphs

Cites Work

• Unnamed Item
• Unavoidable induced subgraphs in large graphs with no homogeneous sets
• Unavoidable vertex-minors in large prime graphs
• Typical subgraphs of 3- and 4-connected graphs
• Unavoidable doubly connected large graphs
• The Erdös-Hajnal Conjecture-A Survey
• The Voting Problem

This page was built for publication: Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets