The removal lemma for tournaments

DOI10.1016/j.jctb.2018.10.001zbMath1414.05131arXiv1710.05317OpenAlexW2963080765WikidataQ129060221 ScholiaQ129060221MaRDI QIDQ2421551

Raphael Yuster, Jacob Fox, Lior Gishboliner, Asaf Shapira

Publication date: 17 June 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.05317

zbMATH Keywords

tournamentremoval lemma

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

A characterization of easily testable induced digraphs and \(k\)-colored graphs ⋮ Minimum degree and the graph removal lemma ⋮ Local-vs-global combinatorics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unavoidable tournaments
• Unavoidable patterns
• Tournaments and colouring
• Graph removal lemmas
• Regularity partitions and the topology of graphons
• Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
• The circular chromatic number of a digraph
• Erdos-Hajnal conjecture for graphs with bounded VC-dimension
• Testing subgraphs in large graphs
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Testing subgraphs in directed graphs
• Efficient testing of large graphs

This page was built for publication: The removal lemma for tournaments