Tournaments with near-linear transitive subsets
From MaRDI portal
Publication:462934
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3520445 (Why is no real title available?)
- scientific article; zbMATH DE number 970795 (Why is no real title available?)
- Ramsey-type theorems
- Ramsey-type theorems with forbidden subgraphs
- The Voting Problem
- Tournaments and colouring
- Upper bounds for Erdös-Hajnal coefficients of tournaments
Cited in
(16)- Tiling transitive tournaments and their blow-ups
- Structure theorem for \(U_{5}\)-free tournaments
- The Erdős-Hajnal conjecture. A survey
- On Convex Subsets in Tournaments
- scientific article; zbMATH DE number 3985259 (Why is no real title available?)
- Coloring dense digraphs
- Stable sets of weak tournaments
- Excluding hooks and their complements
- Transitive convex subsets in large tournaments
- Packing transitive triples in a tournament
- Upper bounds for Erdös-Hajnal coefficients of tournaments
- On the functional completeness of simple tournaments
- Coloring tournaments: from local to global
- On tournaments and their largest transitive subtournaments
- scientific article; zbMATH DE number 6385270 (Why is no real title available?)
- A tournament approach to pattern avoiding matrices
This page was built for publication: Tournaments with near-linear transitive subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462934)