P. D. Seymour

Available identifiers

zbMath Open seymour.paul-dWikidataQ1396427 ScholiaQ1396427MaRDI QIDQ705887

List of research outcomes

Publication	Date of Publication	Type
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs	2024-03-14	Paper
Pure Pairs. IX. Transversal Trees	2024-02-07	Paper
Bipartite graphs with no \(K_6\) minor	2024-01-29	Paper
Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph	2024-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q6147372	2024-01-15	Paper
On a problem of El-Zahar and Erdős	2024-01-15	Paper
Induced subgraph density. VII. The five-vertex path	2023-12-23	Paper
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property	2023-10-25	Paper
Proof of a conjecture of Plummer and Zha	2023-10-12	Paper
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree	2023-10-06	Paper
Polynomial bounds for chromatic number II: Excluding a star‐forest	2023-10-05	Paper
Polynomial bounds for chromatic number. III. Excluding a double star	2023-10-05	Paper
Polynomial bounds for chromatic number VII. Disjoint holes	2023-10-05	Paper
Pure pairs. V: Excluding some long subdivision	2023-10-04	Paper
Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path	2023-10-04	Paper
Erdős–Hajnal for graphs with no 5‐hole	2023-09-20	Paper
Strengthening Rödl's theorem	2023-09-19	Paper
A shorter proof of the path-width theorem	2023-09-10	Paper
Induced subgraph density. V. All paths approach Erdos-Hajnal	2023-07-27	Paper
Induced subgraph density. II. Sparse and dense sets in cographs	2023-07-03	Paper
Some results and problems on tournament structure	2023-06-04	Paper
Pure pairs. IV: Trees in bipartite graphs	2023-05-02	Paper
Even-hole-free graphs still have bisimplicial vertices	2023-05-02	Paper
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix	2023-05-02	Paper
Polynomial bounds for chromatic number VI. Adding a four-vertex path	2023-04-27	Paper
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph	2023-03-21	Paper
Concatenating bipartite graphs	2022-06-13	Paper
Dense minors of graphs with independence number two	2022-05-31	Paper
Detecting a long even hole	2022-05-31	Paper
Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs	2022-03-31	Paper
A survey of χ‐boundedness	2022-03-31	Paper
Polynomial bounds for chromatic number VI. Adding a four-vertex path	2022-02-21	Paper
Finding a Shortest Odd Hole	2022-02-16	Paper
Pure pairs. VIII. Excluding a sparse graph	2022-01-11	Paper
Pure Pairs VI: Excluding an Ordered Tree	2022-01-07	Paper
Subdivided claws and the clique-stable set separation property	2021-12-10	Paper
Graphs with all holes the same length	2021-10-19	Paper
Erdős-Hajnal for cap-free graphs	2021-09-16	Paper
Pure pairs. II: Excluding all subdivisions of a graph	2021-08-03	Paper
A note on simplicial cliques	2021-07-08	Paper
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	2021-07-06	Paper
Detecting a long odd hole	2021-06-25	Paper
Finding an induced path that is not a shortest path	2021-06-14	Paper
New examples of minimal non-strongly-perfect graphs	2021-03-25	Paper
Short directed cycles in bipartite digraphs	2021-01-25	Paper
Pure pairs. I: Trees and linear anticomplete pairs	2020-12-03	Paper
Detecting an Odd Hole	2020-11-11	Paper
Induced subgraphs of graphs with large chromatic number. VI. Banana trees	2020-09-24	Paper
Proof of the Kalai-Meshulam conjecture	2020-09-15	Paper
Holes with hats and Erd\H{o}s-Hajnal	2020-05-06	Paper
Finding a shortest odd hole	2020-04-24	Paper
Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture	2020-04-07	Paper
Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs	2020-04-07	Paper
Excluding the fork and antifork	2020-03-20	Paper
Clustered colouring in minor-closed classes	2020-02-26	Paper
Girth six cubic graphs have Petersen minors	2020-02-26	Paper
Towards Erdős-Hajnal for graphs with no 5-hole	2020-01-17	Paper
Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue	2020-01-17	Paper
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes	2020-01-15	Paper
Induced subgraphs of graphs with large chromatic number. XII. Distant stars	2019-12-30	Paper
Induced subgraphs of graphs with large chromatic number. XIII. New brooms	2019-11-28	Paper
Small families under subdivision	2019-10-10	Paper
\(H\)-colouring \(P_t\)-free graphs in subexponential time	2019-09-05	Paper
Excluded minors in cubic graphs	2019-07-17	Paper
Near-domination in graphs	2019-06-25	Paper
Large rainbow matchings in general graphs	2019-06-18	Paper
Caterpillars in Erdős-Hajnal	2019-06-17	Paper
Bad News for Chordal Partitions	2019-06-14	Paper
Disjoint paths in unions of tournaments	2019-02-08	Paper
Induced subgraphs of graphs with large chromatic number. XI. Orientations	2018-12-20	Paper
Corrigendum to: ``Even pairs and prism corners in square-free Berge graphs	2018-10-11	Paper
Sparse graphs with no polynomial-sized anticomplete pairs	2018-09-28	Paper
Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes	2018-07-24	Paper
Triangle-free graphs with no six-vertex induced path	2018-06-07	Paper
Even pairs and prism corners in square-free Berge graphs	2018-05-09	Paper
Domination in tournaments	2018-04-18	Paper
Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths	2017-07-13	Paper
Majority colourings of digraphs	2017-06-13	Paper
Cyclically five-connected cubic graphs	2017-05-26	Paper
Excluding paths and antipaths	2017-03-31	Paper
Rooted grid minors	2016-11-25	Paper
Colouring perfect graphs with bounded clique number	2016-11-25	Paper
Hadwiger’s Conjecture	2016-10-18	Paper
Induced subgraphs of graphs with large chromatic number. I. Odd holes	2016-10-12	Paper
Disjoint dijoins	2016-06-03	Paper
Three-edge-colouring doublecross cubic graphs	2016-04-21	Paper
Unavoidable induced subgraphs in large graphs with no homogeneous sets	2016-03-14	Paper
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures	2016-03-14	Paper
A Relative of Hadwiger's Conjecture	2016-01-04	Paper
Immersion in four-edge-connected graphs	2015-12-11	Paper
Bipartite minors	2015-12-11	Paper
Tree-chromatic number	2015-12-11	Paper
Excluding A Grid Minor In Planar Digraphs	2015-10-01	Paper
Edge-colouring seven-regular planar graphs	2015-08-21	Paper
Edge-colouring eight-regular planar graphs	2015-08-21	Paper
Wheel-free planar graphs	2015-06-18	Paper
Excluding a Substar and an Antisubstar	2015-05-20	Paper
Tournament minors	2015-05-04	Paper
Tree-width and planar minors	2015-03-05	Paper
https://portal.mardi4nfdi.de/entity/Q2934642	2014-12-18	Paper
Disjoint paths in tournaments	2014-12-12	Paper
Edge-disjoint paths in digraphs with bounded independence number	2014-11-21	Paper
Criticality for multicommodity flows	2014-11-21	Paper
Tournaments with near-linear transitive subsets	2014-10-22	Paper
Detecting an induced net subdivision	2014-10-13	Paper
Tournament pathwidth and topological containment	2014-10-06	Paper
Excluding pairs of graphs	2014-08-28	Paper
Extending the Gyárfás-Sumner conjecture	2014-08-27	Paper
Rao's degree sequence conjecture	2014-08-27	Paper
Perfect matchings in planar cubic graphs	2014-06-13	Paper
A counterexample to a conjecture of Schwartz	2014-05-30	Paper
Proof of a conjecture of Bowlin and Brin on four-colouring triangulations	2014-02-10	Paper
Reducibility in the Four-Color Theorem	2014-01-24	Paper
Discharging cartwheels	2014-01-24	Paper
Packing seagulls	2013-08-06	Paper
Finding minimum clique capacity	2013-08-06	Paper
A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs	2013-06-27	Paper
The Minimal Automorphism-Free Tree	2013-03-06	Paper
Tournaments and colouring	2013-01-18	Paper
Claw-free graphs. VII. Quasi-line graphs	2013-01-14	Paper
Growing Without Cloning	2012-09-12	Paper
Tour Merging via Branch-Decomposition	2012-05-30	Paper
Three-colourable perfect graphs without even pairs	2012-05-04	Paper
Graph minors. XXII. Irrelevant vertices in linkage problems	2012-05-04	Paper
Tournament immersion and cutwidth	2012-03-19	Paper
The three-in-a-tree problem	2011-12-19	Paper
The edge-density for \(K_{2,t}\) minors	2011-01-14	Paper
A well-quasi-order for tournaments	2011-01-14	Paper
Claw-free graphs. VI: Colouring	2010-11-05	Paper
Certifying large branch-width	2010-08-16	Paper
Counting paths in digraphs	2010-04-27	Paper
Graph minors XXIII. Nash-Williams' immersion conjecture	2010-04-21	Paper
\(K_{4}\)-free graphs with no odd holes	2010-04-21	Paper
Graph minors. XXI. graphs with unique linkages	2009-06-23	Paper
https://portal.mardi4nfdi.de/entity/Q3621680	2009-04-21	Paper
Even pairs in Berge graphs	2009-03-04	Paper
On the odd-minor variant of Hadwiger's conjecture	2009-01-21	Paper
Bisimplicial vertices in even-hole-free graphs	2008-12-08	Paper
Claw-free graphs. V. Global structure	2008-12-08	Paper
Cycles in dense digraphs	2008-10-21	Paper
Claw-free graphs. IV: Decomposition theorem	2008-10-07	Paper
Claw-free graphs. III: Circular interval graphs	2008-07-24	Paper
Claw-free graphs. II: Non-orientable prismatic graphs	2008-03-14	Paper
Solution of three problems of Cornuéjols	2007-12-10	Paper
https://portal.mardi4nfdi.de/entity/Q5421811	2007-10-24	Paper
Claw-free graphs. I: Orientable prismatic graphs	2007-10-10	Paper
Packing non-zero \(A\)-paths in group-labelled graphs	2007-05-08	Paper
The roots of the independence polynomial of a clawfree graph	2007-04-16	Paper
Testing branch-width	2007-04-16	Paper
https://portal.mardi4nfdi.de/entity/Q3416248	2007-01-19	Paper
The strong perfect graph theorem	2007-01-04	Paper
Proper minor-closed families are small	2006-08-16	Paper
Solution of two fractional packing problems of Lovász. (Reprint)	2006-08-04	Paper
Disjoint paths in graphs. (Reprint)	2006-08-04	Paper
Approximating clique-width and branch-width	2006-07-12	Paper
Recognizing Berge graphs	2006-06-27	Paper
Detecting even holes	2005-04-21	Paper
Graph minors. XX: Wagner's conjecture	2005-02-16	Paper
Hadwiger's conjecture for line graphs	2004-10-04	Paper
Excluding any graph as a minor allows a low tree-width 2-coloring	2004-08-06	Paper
Graph minors. XIX: Well-quasi-ordering on a surface.	2004-03-14	Paper
Graph minors. XVI: Excluding a non-planar graph	2003-10-15	Paper
Graph minors. XVIII: Tree-decompositions and well-quasi-ordering	2003-10-15	Paper
Progress on perfect graphs	2003-09-01	Paper
Extending partial 3-colourings in a planar graph	2003-08-17	Paper
Directed tree-width	2002-12-10	Paper
Colouring Eulerian triangulations	2002-12-10	Paper
Coloring locally bipartite graphs on surfaces.	2002-12-10	Paper
Node placement and sizing for copper broadband access networks	2002-06-09	Paper
Spanning trees with many leaves	2002-06-03	Paper
Long cycles in critical graphs	2001-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4527007	2001-02-28	Paper
Fractional colouring and Hadwiger's conjecture	2000-06-25	Paper
Graph minors. XVII: Taming a vortex	2000-06-25	Paper
Permanents, Pfaffian orientations, and even directed circuits	2000-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q4865969	2000-01-09	Paper
The Ring Loading Problem	1999-11-23	Paper
A Petersen on a pentagon	1999-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4228512	1999-05-18	Paper
A note on list arboricity	1998-09-06	Paper
The Ring Loading Problem	1998-05-11	Paper
The four-colour theorem	1998-03-16	Paper
Packing directed circuits	1998-01-11	Paper
Tutte's edge-colouring conjecture	1997-10-20	Paper
Two chromatic polynomial conjectures	1997-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q4340879	1997-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q5284579	1997-05-28	Paper
Graph minors. XV: Giant steps	1997-04-21	Paper
Irreducible triangulations of surfaces	1997-02-23	Paper
Packing circuits in eulerian digraphs	1996-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q4871752	1996-08-20	Paper
Graph minors. XII: Distance on a surface	1996-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q4871758	1996-06-24	Paper
Sachs' linkless embedding conjecture	1996-02-20	Paper
Hadwiger's conjecture for \(K_ 6\)-free graphs	1996-01-18	Paper
Excluding infinite clique minors	1995-12-11	Paper
Packing directed circuits fractionally	1995-11-26	Paper
Kuratowski chains	1995-09-20	Paper
Petersen family minors	1995-09-20	Paper
Graph minors. XIV: Extending an embedding	1995-09-20	Paper
Graph minors. XIII: The disjoint paths problem	1995-07-02	Paper
Packing odd paths	1995-04-09	Paper
Quickly excluding a planar graph	1995-03-02	Paper
A note on hyperplane generation	1995-01-02	Paper
Graph minors. XI: Circuits on a surface	1994-11-14	Paper
The Complexity of Multiterminal Cuts	1994-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q4273877	1994-10-10	Paper
Planar Separators	1994-10-10	Paper
Bounding the vertex cover number of a hypergraph	1994-09-15	Paper
Call routing and the ratcatcher	1994-08-11	Paper
Graph searching and a min-max theorem for tree-width	1994-06-30	Paper
Disjoint cycles in directed graphs on the torus and the Klein bottle	1994-05-24	Paper
Circular embedding of planar graphs in nonspherical surfaces	1994-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q4273851	1994-01-13	Paper
https://portal.mardi4nfdi.de/entity/Q4273838	1994-01-06	Paper
https://portal.mardi4nfdi.de/entity/Q4273869	1994-01-06	Paper
On the fractional matching polytope of a hypergraph	1993-09-15	Paper
Linkless embeddings of graphs in 3-space	1993-06-29	Paper
Excluding Infinite Trees	1993-05-16	Paper
Directed triangles in directed graphs	1993-05-16	Paper
On secret-sharing matroids	1993-03-10	Paper
A fractional version of the Erdős-Faber-Lovász conjecture	1993-01-16	Paper
Excluding Subdivisions of Infinite Cliques	1993-01-16	Paper
Excluding infinite minors	1992-09-27	Paper
An end-faithful spanning tree counterexample	1992-09-27	Paper
Disjoint Paths in a Planar Graph—A General Theorem	1992-06-28	Paper
Directed circuits on a torus	1992-06-27	Paper
A simpler proof and a generalization of the zero-trees theorem	1992-06-27	Paper
An End-Faithful Spanning Tree Counterexample	1992-06-27	Paper
Graph minors. X: Obstructions to tree-decomposition	1992-06-26	Paper
Quickly excluding a forest	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3972953	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3973410	1992-06-26	Paper
A Separator Theorem for Nonplanar Graphs	1992-06-25	Paper
Monotonicity in graph searching	1992-06-25	Paper
Graph minors. IX: Disjoint crossed paths	1992-06-25	Paper
Graph minors. IV: Tree-width and well-quasi-ordering	1990-01-01	Paper
Graph minors. VIII: A Kuratowski theorem for general surfaces	1990-01-01	Paper
Colouring series-parallel graphs	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3360883	1990-01-01	Paper
Graphs with small bandwidth and cutwidth	1989-01-01	Paper
A counterexample to the rank-coloring conjecture	1989-01-01	Paper
Self-organizing sequential search and Hilbert's inequalities	1988-01-01	Paper
On induced subgraphs of the cube	1988-01-01	Paper
Graph minors. VII: Disjoint paths on a surface	1988-01-01	Paper
On the connectivity function of a matroid	1988-01-01	Paper
On Forbidden Minors for GF(3)	1988-01-01	Paper
Characterization of even directed graphs	1987-01-01	Paper
Large induced degenerate subgraphs	1987-01-01	Paper
The smallest n-uniform hypergraph with positive discrepancy	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3773882	1987-01-01	Paper
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number	1987-01-01	Paper
Graph minors. VI. Disjoint paths across a disc	1986-01-01	Paper
Graph minors. V. Excluding a planar graph	1986-01-01	Paper
Triples in matroid circuits	1986-01-01	Paper
Adjacency in binary matroids	1986-01-01	Paper
Graph minors. II. Algorithmic aspects of tree-width	1986-01-01	Paper
Counting points in hypercubes and convolution measure algebras	1985-01-01	Paper
Minors of 3-connected matroids	1985-01-01	Paper
Disjoint Paths—A Survey	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3684139	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3737442	1985-01-01	Paper
Graph minors. III. Planar tree-width	1984-01-01	Paper
A note on nongraphic matroids	1984-01-01	Paper
Averaging sets: A generalization of mean values and spherical designs	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3680875	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3220637	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3222217	1984-01-01	Paper
A generalization of chordal graphs	1984-01-01	Paper
Graph minors. I. Excluding a forest	1983-01-01	Paper
Packing nearly-disjoint sets	1982-01-01	Paper
The Structure of Homometric Sets	1982-01-01	Paper
On the points-lines-planes conjecture	1982-01-01	Paper
Multicommodity flows in planar graphs	1981-01-01	Paper
On Tutte's extension of the four-colour problem	1981-01-01	Paper
Nowhere-zero 6-flows	1981-01-01	Paper
Matroids and multicommodity flows	1981-01-01	Paper
On minors of non-binary matroids	1981-01-01	Paper
Even circuits in planar graphs	1981-01-01	Paper
Recognizing graphic matroids	1981-01-01	Paper
On Odd Cuts and Plane Multicommodity Flows	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3927264	1981-01-01	Paper
Functions of Bounded Second Variation and Stieltjes-Type Integrals	1981-01-01	Paper
Decomposition of regular matroids	1980-01-01	Paper
Packing and covering with matroid circuits	1980-01-01	Paper
Disjoint paths in graphs	1980-01-01	Paper
Four-terminus flows	1980-01-01	Paper
On Tutte's Characterization of Graphic Matroids	1980-01-01	Paper
A short proof of the two-commodity flow theorem	1979-01-01	Paper
Matroid representation over GF(3)	1979-01-01	Paper
Solution of two fractional packing problems of Lovász	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3916595	1979-01-01	Paper
On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte	1979-01-01	Paper
A two-commodity cut theorem	1978-01-01	Paper
Counterexample to a conjecture of Jeurissen	1978-01-01	Paper
Percolation Probabilities on the Square Lattice	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4198528	1978-01-01	Paper
The matroids with the max-flow min-cut property	1977-01-01	Paper
A note on the production of matroid minors	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4101838	1976-01-01	Paper
The Forbidden Minors of Binary Clutters	1976-01-01	Paper
A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS	1976-01-01	Paper
Combinatorial applications of an inequality from statistical mechanics	1975-01-01	Paper
ON THE TWO-COLOURING OF HYPERGRAPHS	1974-01-01	Paper
A Note on a Combinatorial Problem of ErdŐS and Hajnal	1974-01-01	Paper
On incomparable collections of sets	1973-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: P. D. Seymour