Pure Pairs. IX. Transversal Trees
From MaRDI portal
Publication:6188521
DOI10.1137/21m1456509arXiv2111.00532OpenAlexW3211309039MaRDI QIDQ6188521
P. D. Seymour, Sophie Spirkl, Alexander D. Scott
Publication date: 7 February 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.00532
Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- On universality of graphs with uniformly distributed edges
- Pure pairs. I: Trees and linear anticomplete pairs
- Towards Erdős-Hajnal for graphs with no 5-hole
- Caterpillars in Erdős-Hajnal
- Recent developments in graph Ramsey theory
- A Remark on Stirling's Formula
- Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs
- Erdős–Hajnal for graphs with no 5‐hole
This page was built for publication: Pure Pairs. IX. Transversal Trees