Unavoidable tournaments
From MaRDI portal
Publication:895998
DOI10.1016/j.jctb.2015.07.005zbMath1327.05140OpenAlexW2911409521MaRDI QIDQ895998
Publication date: 11 December 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2015.07.005
Related Items
The removal lemma for tournaments, Skew-adjacency matrices of tournaments with bounded principal minors, Large Unavoidable Subtournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Excluding pairs of graphs
- Supersaturated graphs and hypergraphs
- Unavoidable patterns
- Testing hypergraph colorability
- Tournaments and colouring
- Forcing large transitive subtournaments
- EH-suprema of tournaments with no nontrivial homogeneous sets
- On extremal problems of graphs and generalized graphs
- Upper Bounds for Erdös-Hajnal Coefficients of Tournaments
- The Erdös-Hajnal Conjecture-A Survey
- Sublinear Time Algorithms
- Graph Theory and Probability
- The Voting Problem
- On graphs with linear Ramsey numbers
- Testing subgraphs in large graphs
- Testing subgraphs in directed graphs