Author:
Scott Alex,Seymour Paul,Spirkl Sophie
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)
2. Chudnovsky, M., Scott, A., Seymour, P., Spirkl, S.: Pure pairs. I. Trees and linear anticomplete pairs. Adv. Math. 375, 107396 (2020). arXiv:1809.00919
3. Chudnovsky, M., Scott, A., Seymour, P., Spirkl, S.: Pure pairs. II. Excluding all subdivisions of a graph. Combinatorica 41, 279–405 (2021). arXiv:1804.01060
4. Erdős, P., Hajnal, A.: On Spanned Subgraphs of Graphs. Graphentheorie und Ihre Anwendungen, Oberhof (1977)
5. Erdős, P., Hajnal, A.: Ramsey-type theorems. Discret. Appl. Math. 25, 37–52 (1989)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献