Pure Pairs VI: Excluding an Ordered Tree

DOI10.1137/20M1368331zbMath1480.05077arXiv2009.10671OpenAlexW4205569288MaRDI QIDQ5020840

Sophie Spirkl, Alexander D. Scott, P. D. Seymour

Publication date: 7 January 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

induced subgraphstreesordered graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (4)

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix ⋮ Pure pairs. X. Tournaments and the strong Erdős-Hajnal property ⋮ Pure pairs. I: Trees and linear anticomplete pairs ⋮ Growing balanced covering sets

Cites Work

• Unnamed Item
• Unnamed Item
• Turán-type results for partial orders and intersection graphs of convex sets
• Ramsey-type theorems
• A bipartite analogue of Dilworth's theorem
• On universality of graphs with uniformly distributed edges
• Erdős-Hajnal-type results for monotone paths
• Pure pairs. I: Trees and linear anticomplete pairs
• Ordered graphs and large bi-cliques in intersection graphs of curves
• Crossing patterns of semi-algebraic sets
• A Ramsey-Type Theorem for Orderings of a Graph
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: Pure Pairs VI: Excluding an Ordered Tree