Pure pairs. X. Tournaments and the strong Erdős-Hajnal property

DOI10.1016/J.EJC.2023.103786MaRDI QIDQ6081115zbMATH OpenFDO

Authors Maria Chudnovsky, Alex Scott, Paul Seymour, Sophie Spirkl

Publication date 25 October 2023

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Hajnal conjecturetransitive subtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorics of partially ordered sets (06A07)

Abstract: 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$ with $|A|,|B|gec|G|$, where $c>0$ is a constant independent of $G$? Let us say that such a tournament $H$ has the strong EH-property. As far as we know, it might be that a tournament $H$ has this property if and only if its vertex set has a linear ordering in which its backedges form a forest. Certainly this condition is necessary, but we are far from proving sufficiency. We make a small step in this direction, showing that if a tournament can be ordered with at most three backedges then it has the strong EH-property (except for one case, that we could not decide). In particular, every tournament with at most six vertices has the property, except for three that we could not decide. We also give a seven-vertex tournament that does not have the strong EH-property. This is related to the Erdos-Hajnal conjecture, which in one form says that for every tournament $H$ there exists $au>0$ such that every tournament $G$ not containing $H$ as a subtournament has a transitive subtournament of cardinality at least $|G{|}^{a}u$. Let us say that a tournament $H$ satisfying this has the EH-property. It is known that every tournament with the strong EH-property also has the EH-property; so our result extends work by Berger, Choromanski and Chudnovsky, who proved that every tournament with at most six vertices has the EH-property, except for one that they did not decide.

Recommendations

• Forests and the strong Erdős-Hajnal property
• Excluding pairs of tournaments
• Tournaments and the strong Erdős-Hajnal property
• Forbidding couples of tournaments and the Erdös-Hajnal conjecture
• scientific article; zbMATH DE number 7731176

Cites work

• A bipartite analogue of Dilworth's theorem
• A Ramsey-Type Theorem for Orderings of a Graph
• EH-suprema of tournaments with no nontrivial homogeneous sets
• Erdös–Hajnal conjecture for new infinite families of tournaments
• Erdős–Hajnal for graphs with no 5‐hole
• Forcing large transitive subtournaments
• Graph Theory and Probability
• scientific article; zbMATH DE number 3628985 (Why is no real title available?)
• scientific article; zbMATH DE number 7731176 (Why is no real title available?)
• On the Erdős-Hajnal conjecture for six-vertex tournaments
• On universality of graphs with uniformly distributed edges
• Pure pairs. I: Trees and linear anticomplete pairs
• Pure pairs. VI: Excluding an ordered tree
• Ramsey-type theorems
• Ramsey-type theorems with forbidden subgraphs
• Strengthening Rödl's theorem
• Tournaments and colouring
• Tournaments and the strong Erdős-Hajnal property

Cited in

(2)

• Forests and the strong Erdős-Hajnal property
• Coloring tournaments with few colors: algorithms and complexity

This page was built for publication: Pure pairs. X. Tournaments and the strong Erdős-Hajnal property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081115)