Projects per year
Fingerprint
Dive into the research topics where Paul Seymour is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
DMS-EPSRC: Induced subgraphs and graph structure
NSF - National Science Foundation
7/1/22 → 6/30/27
Project: Research project
-
Induced Subgraphs Exclusion: Structure and Algorithms
Air Force Office of Scientific Research
7/1/22 → 6/30/25
Project: Research project
-
Constructions and Decompositions in Graph Theory
Air Force Office of Scientific Research
7/1/19 → 6/30/22
Project: Research project
-
Induced Subgraphs and Coloring
NSF - National Science Foundation
7/1/18 → 6/30/21
Project: Research project
-
-
Induced paths in graphs without anticomplete cycles
Nguyen, T., Scott, A. & Seymour, P., Jan 2024, In: Journal of Combinatorial Theory. Series B. 164, p. 321-339 19 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph
Scott, A. & Seymour, P., Jan 2024, In: Journal of Combinatorial Theory. Series B. 164, p. 473-491 19 p.Research output: Contribution to journal › Article › peer-review
-
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
Chudnovsky, M., Scott, A., Seymour, P. & Spirkl, S., Jan 2024, In: European Journal of Combinatorics. 115, 103786.Research output: Contribution to journal › Article › peer-review
Open Access -
Erdős–Hajnal for graphs with no 5-hole
Chudnovsky, M., Scott, A., Seymour, P. & Spirkl, S., Mar 2023, In: Proceedings of the London Mathematical Society. 126, 3, p. 997-1014 18 p.Research output: Contribution to journal › Article › peer-review
Open Access4 Scopus citations -
Even-hole-free graphs still have bisimplicial vertices
Chudnovsky, M. & Seymour, P., Jul 2023, In: Journal of Combinatorial Theory. Series B. 161, p. 331-381 51 p.Research output: Contribution to journal › Article › peer-review