Pure pairs. X. Tournaments and the strong Erdos-Hajnal property
A pure pair in a tournament G is an ordered pair (A, B) of disjoint subsets of V (G) such that every vertex in B is adjacent from every vertex in A. Which tournaments H have the property that if G is a tournament not containing H as a subtournament, and |G| > 1, there is a pure pair (A, B) in G w...
Main Authors: | Chudnovsky, M, Scott, A, Seymour, P, Spirkl, S |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2023
|
Similar Items
-
Erdős–Hajnal for graphs with no 5-hole
by: Chudnovsky, M, et al.
Published: (2023) -
Towards Erdős-Hajnal for graphs with no 5-hole
by: Chudnovsky, M, et al.
Published: (2019) -
Erdos–Hajnal-type theorems in hypergraphs
by: Conlon, David, et al.
Published: (2015) -
Pure pairs. I. Trees and linear anticomplete pairs
by: Chudnovsky, M, et al.
Published: (2020) -
Pure pairs. II. Excluding all subdivisions of a graph
by: Chudnovsky, M, et al.
Published: (2021)