Unavoidable tournaments
From MaRDI portal
Publication:895998
Recommendations
Cites work
- EH-suprema of tournaments with no nontrivial homogeneous sets
- Excluding pairs of graphs
- Forcing large transitive subtournaments
- Graph Theory and Probability
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3221981 (Why is no real title available?)
- On extremal problems of graphs and generalized graphs
- On graphs with linear Ramsey numbers
- Sublinear time algorithms
- Supersaturated graphs and hypergraphs
- Testing hypergraph colorability
- Testing subgraphs in directed graphs
- Testing subgraphs in large graphs
- The Erdős-Hajnal conjecture. A survey
- The Voting Problem
- Tournaments and colouring
- Unavoidable patterns
- Upper bounds for Erdös-Hajnal coefficients of tournaments
Cited in
(14)- The removal lemma for tournaments
- Partially critical tournaments
- Tournaments with gaps
- scientific article; zbMATH DE number 5914930 (Why is no real title available?)
- Large unavoidable subtournaments
- scientific article; zbMATH DE number 3959460 (Why is no real title available?)
- Quasi-carousel tournaments
- scientific article; zbMATH DE number 1389739 (Why is no real title available?)
- Turán theorems for unavoidable patterns
- Large unavoidable subtournaments
- Skew-adjacency matrices of tournaments with bounded principal minors
- Unavoidable structures in infinite tournaments
- On determinants of tournaments and the characterization of \(\mathcal{D}_5\)
- The nature of tournaments
This page was built for publication: Unavoidable tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895998)