Upper bounds for Erdös-Hajnal coefficients of tournaments
DOI10.1002/JGT.21696zbMATH Open1272.05119OpenAlexW1579766172MaRDI QIDQ2852616FDOQ2852616
Authors: Krzysztof Choromanski
Publication date: 9 October 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21696
Recommendations
transitive tournamentsquadratic residue tournamentsthe probabilistic methodthe Erdös-Hajnal coefficientthe Erdös-Hajnal conjecture
Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)
Cites Work
Cited In (10)
- Unavoidable tournaments
- On the Erdős-Hajnal conjecture for six-vertex tournaments
- The Erdős-Hajnal conjecture. A survey
- Tournaments with near-linear transitive subsets
- Forbidding couples of tournaments and the Erdös-Hajnal conjecture
- Excluding hooks and their complements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Erdös–Hajnal conjecture for new infinite families of tournaments
- EH-suprema of tournaments with no nontrivial homogeneous sets
This page was built for publication: Upper bounds for Erdös-Hajnal coefficients of tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852616)