P. D. Seymour

From MaRDI portal
Revision as of 22:39, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page P. D. Seymour to P. D. Seymour: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:705887

Available identifiers

zbMath Open seymour.paul-dDBLP52/1135WikidataQ1396427 ScholiaQ1396427MaRDI QIDQ705887

List of research outcomes

PublicationDate of PublicationType
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs2024-03-14Paper
Pure Pairs. IX. Transversal Trees2024-02-07Paper
Bipartite graphs with no \(K_6\) minor2024-01-29Paper
Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph2024-01-29Paper
https://portal.mardi4nfdi.de/entity/Q61473722024-01-15Paper
On a problem of El-Zahar and Erdős2024-01-15Paper
Induced subgraph density. VII. The five-vertex path2023-12-23Paper
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property2023-10-25Paper
Proof of a conjecture of Plummer and Zha2023-10-12Paper
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree2023-10-06Paper
Polynomial bounds for chromatic number II: Excluding a star‐forest2023-10-05Paper
Polynomial bounds for chromatic number. III. Excluding a double star2023-10-05Paper
Polynomial bounds for chromatic number VII. Disjoint holes2023-10-05Paper
Pure pairs. V: Excluding some long subdivision2023-10-04Paper
Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path2023-10-04Paper
Erdős–Hajnal for graphs with no 5‐hole2023-09-20Paper
Strengthening Rödl's theorem2023-09-19Paper
A shorter proof of the path-width theorem2023-09-10Paper
Induced subgraph density. V. All paths approach Erdos-Hajnal2023-07-27Paper
Induced subgraph density. II. Sparse and dense sets in cographs2023-07-03Paper
Some results and problems on tournament structure2023-06-04Paper
Pure pairs. IV: Trees in bipartite graphs2023-05-02Paper
Even-hole-free graphs still have bisimplicial vertices2023-05-02Paper
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix2023-05-02Paper
Polynomial bounds for chromatic number VI. Adding a four-vertex path2023-04-27Paper
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph2023-03-21Paper
Concatenating bipartite graphs2022-06-13Paper
Detecting a long even hole2022-05-31Paper
Dense minors of graphs with independence number two2022-05-31Paper
Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs2022-03-31Paper
A survey of χ‐boundedness2022-03-31Paper
Polynomial bounds for chromatic number VI. Adding a four-vertex path2022-02-21Paper
Finding a Shortest Odd Hole2022-02-16Paper
Pure pairs. VIII. Excluding a sparse graph2022-01-11Paper
Pure Pairs VI: Excluding an Ordered Tree2022-01-07Paper
Subdivided claws and the clique-stable set separation property2021-12-10Paper
Graphs with all holes the same length2021-10-19Paper
Erdős-Hajnal for cap-free graphs2021-09-16Paper
Pure pairs. II: Excluding all subdivisions of a graph2021-08-03Paper
A note on simplicial cliques2021-07-08Paper
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings2021-07-06Paper
Detecting a long odd hole2021-06-25Paper
Finding an induced path that is not a shortest path2021-06-14Paper
New examples of minimal non-strongly-perfect graphs2021-03-25Paper
Short directed cycles in bipartite digraphs2021-01-25Paper
Pure pairs. I: Trees and linear anticomplete pairs2020-12-03Paper
Detecting an Odd Hole2020-11-11Paper
Induced subgraphs of graphs with large chromatic number. VI. Banana trees2020-09-24Paper
Proof of the Kalai-Meshulam conjecture2020-09-15Paper
Holes with hats and Erd\H{o}s-Hajnal2020-05-06Paper
Finding a shortest odd hole2020-04-24Paper
Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture2020-04-07Paper
Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs2020-04-07Paper
Excluding the fork and antifork2020-03-20Paper
Clustered colouring in minor-closed classes2020-02-26Paper
Girth six cubic graphs have Petersen minors2020-02-26Paper
Towards Erdős-Hajnal for graphs with no 5-hole2020-01-17Paper
Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue2020-01-17Paper
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes2020-01-15Paper
Induced subgraphs of graphs with large chromatic number. XII. Distant stars2019-12-30Paper
Induced subgraphs of graphs with large chromatic number. XIII. New brooms2019-11-28Paper
Small families under subdivision2019-10-10Paper
\(H\)-colouring \(P_t\)-free graphs in subexponential time2019-09-05Paper
Excluded minors in cubic graphs2019-07-17Paper
Near-domination in graphs2019-06-25Paper
Large rainbow matchings in general graphs2019-06-18Paper
Caterpillars in Erdős-Hajnal2019-06-17Paper
Bad News for Chordal Partitions2019-06-14Paper
Disjoint paths in unions of tournaments2019-02-08Paper
Induced subgraphs of graphs with large chromatic number. XI. Orientations2018-12-20Paper
Corrigendum to: ``Even pairs and prism corners in square-free Berge graphs2018-10-11Paper
Sparse graphs with no polynomial-sized anticomplete pairs2018-09-28Paper
Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes2018-07-24Paper
Triangle-free graphs with no six-vertex induced path2018-06-07Paper
Even pairs and prism corners in square-free Berge graphs2018-05-09Paper
Domination in tournaments2018-04-18Paper
Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths2017-07-13Paper
Majority colourings of digraphs2017-06-13Paper
Cyclically five-connected cubic graphs2017-05-26Paper
Excluding paths and antipaths2017-03-31Paper
Rooted grid minors2016-11-25Paper
Colouring perfect graphs with bounded clique number2016-11-25Paper
Hadwiger’s Conjecture2016-10-18Paper
Induced subgraphs of graphs with large chromatic number. I. Odd holes2016-10-12Paper
Disjoint dijoins2016-06-03Paper
Three-edge-colouring doublecross cubic graphs2016-04-21Paper
Unavoidable induced subgraphs in large graphs with no homogeneous sets2016-03-14Paper
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures2016-03-14Paper
A Relative of Hadwiger's Conjecture2016-01-04Paper
Immersion in four-edge-connected graphs2015-12-11Paper
Bipartite minors2015-12-11Paper
Tree-chromatic number2015-12-11Paper
Excluding A Grid Minor In Planar Digraphs2015-10-01Paper
Edge-colouring seven-regular planar graphs2015-08-21Paper
Edge-colouring eight-regular planar graphs2015-08-21Paper
Wheel-free planar graphs2015-06-18Paper
Excluding a Substar and an Antisubstar2015-05-20Paper
Tournament minors2015-05-04Paper
Tree-width and planar minors2015-03-05Paper
https://portal.mardi4nfdi.de/entity/Q29346422014-12-18Paper
Disjoint paths in tournaments2014-12-12Paper
Edge-disjoint paths in digraphs with bounded independence number2014-11-21Paper
Criticality for multicommodity flows2014-11-21Paper
Tournaments with near-linear transitive subsets2014-10-22Paper
Detecting an induced net subdivision2014-10-13Paper
Tournament pathwidth and topological containment2014-10-06Paper
Excluding pairs of graphs2014-08-28Paper
Extending the Gyárfás-Sumner conjecture2014-08-27Paper
Rao's degree sequence conjecture2014-08-27Paper
Perfect matchings in planar cubic graphs2014-06-13Paper
A counterexample to a conjecture of Schwartz2014-05-30Paper
Proof of a conjecture of Bowlin and Brin on four-colouring triangulations2014-02-10Paper
Reducibility in the Four-Color Theorem2014-01-24Paper
Discharging cartwheels2014-01-24Paper
Packing seagulls2013-08-06Paper
Finding minimum clique capacity2013-08-06Paper
A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs2013-06-27Paper
The Minimal Automorphism-Free Tree2013-03-06Paper
Tournaments and colouring2013-01-18Paper
Claw-free graphs. VII. Quasi-line graphs2013-01-14Paper
Growing Without Cloning2012-09-12Paper
Tour Merging via Branch-Decomposition2012-05-30Paper
Three-colourable perfect graphs without even pairs2012-05-04Paper
Graph minors. XXII. Irrelevant vertices in linkage problems2012-05-04Paper
Tournament immersion and cutwidth2012-03-19Paper
The three-in-a-tree problem2011-12-19Paper
The edge-density for \(K_{2,t}\) minors2011-01-14Paper
A well-quasi-order for tournaments2011-01-14Paper
Claw-free graphs. VI: Colouring2010-11-05Paper
Certifying large branch-width2010-08-16Paper
Counting paths in digraphs2010-04-27Paper
Graph minors XXIII. Nash-Williams' immersion conjecture2010-04-21Paper
\(K_{4}\)-free graphs with no odd holes2010-04-21Paper
Graph minors. XXI. graphs with unique linkages2009-06-23Paper
https://portal.mardi4nfdi.de/entity/Q36216802009-04-21Paper
Even pairs in Berge graphs2009-03-04Paper
On the odd-minor variant of Hadwiger's conjecture2009-01-21Paper
Bisimplicial vertices in even-hole-free graphs2008-12-08Paper
Claw-free graphs. V. Global structure2008-12-08Paper
Cycles in dense digraphs2008-10-21Paper
Claw-free graphs. IV: Decomposition theorem2008-10-07Paper
Claw-free graphs. III: Circular interval graphs2008-07-24Paper
Claw-free graphs. II: Non-orientable prismatic graphs2008-03-14Paper
Solution of three problems of Cornuéjols2007-12-10Paper
https://portal.mardi4nfdi.de/entity/Q54218112007-10-24Paper
Claw-free graphs. I: Orientable prismatic graphs2007-10-10Paper
Packing non-zero \(A\)-paths in group-labelled graphs2007-05-08Paper
The roots of the independence polynomial of a clawfree graph2007-04-16Paper
Testing branch-width2007-04-16Paper
https://portal.mardi4nfdi.de/entity/Q34162482007-01-19Paper
The strong perfect graph theorem2007-01-04Paper
Proper minor-closed families are small2006-08-16Paper
Solution of two fractional packing problems of Lovász. (Reprint)2006-08-04Paper
Disjoint paths in graphs. (Reprint)2006-08-04Paper
Approximating clique-width and branch-width2006-07-12Paper
Recognizing Berge graphs2006-06-27Paper
Detecting even holes2005-04-21Paper
Graph minors. XX: Wagner's conjecture2005-02-16Paper
Hadwiger's conjecture for line graphs2004-10-04Paper
Excluding any graph as a minor allows a low tree-width 2-coloring2004-08-06Paper
Graph minors. XIX: Well-quasi-ordering on a surface.2004-03-14Paper
Graph minors. XVI: Excluding a non-planar graph2003-10-15Paper
Graph minors. XVIII: Tree-decompositions and well-quasi-ordering2003-10-15Paper
Progress on perfect graphs2003-09-01Paper
Extending partial 3-colourings in a planar graph2003-08-17Paper
Directed tree-width2002-12-10Paper
Colouring Eulerian triangulations2002-12-10Paper
Coloring locally bipartite graphs on surfaces.2002-12-10Paper
Node placement and sizing for copper broadband access networks2002-06-09Paper
Spanning trees with many leaves2002-06-03Paper
Long cycles in critical graphs2001-05-10Paper
https://portal.mardi4nfdi.de/entity/Q45270072001-02-28Paper
Fractional colouring and Hadwiger's conjecture2000-06-25Paper
Graph minors. XVII: Taming a vortex2000-06-25Paper
Permanents, Pfaffian orientations, and even directed circuits2000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q48659692000-01-09Paper
The Ring Loading Problem1999-11-23Paper
A Petersen on a pentagon1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42285121999-05-18Paper
A note on list arboricity1998-09-06Paper
The Ring Loading Problem1998-05-11Paper
The four-colour theorem1998-03-16Paper
Packing directed circuits1998-01-11Paper
Tutte's edge-colouring conjecture1997-10-20Paper
Two chromatic polynomial conjectures1997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q43408791997-06-15Paper
https://portal.mardi4nfdi.de/entity/Q52845791997-05-28Paper
Graph minors. XV: Giant steps1997-04-21Paper
Irreducible triangulations of surfaces1997-02-23Paper
Packing circuits in eulerian digraphs1996-11-24Paper
https://portal.mardi4nfdi.de/entity/Q48717521996-08-20Paper
Graph minors. XII: Distance on a surface1996-07-04Paper
https://portal.mardi4nfdi.de/entity/Q48717581996-06-24Paper
Sachs' linkless embedding conjecture1996-02-20Paper
Hadwiger's conjecture for \(K_ 6\)-free graphs1996-01-18Paper
Excluding infinite clique minors1995-12-11Paper
Packing directed circuits fractionally1995-11-26Paper
Kuratowski chains1995-09-20Paper
Petersen family minors1995-09-20Paper
Graph minors. XIV: Extending an embedding1995-09-20Paper
Graph minors. XIII: The disjoint paths problem1995-07-02Paper
Packing odd paths1995-04-09Paper
Quickly excluding a planar graph1995-03-02Paper
A note on hyperplane generation1995-01-02Paper
Graph minors. XI: Circuits on a surface1994-11-14Paper
The Complexity of Multiterminal Cuts1994-10-17Paper
https://portal.mardi4nfdi.de/entity/Q42738771994-10-10Paper
Planar Separators1994-10-10Paper
Bounding the vertex cover number of a hypergraph1994-09-15Paper
Call routing and the ratcatcher1994-08-11Paper
Graph searching and a min-max theorem for tree-width1994-06-30Paper
Disjoint cycles in directed graphs on the torus and the Klein bottle1994-05-24Paper
Circular embedding of planar graphs in nonspherical surfaces1994-04-04Paper
https://portal.mardi4nfdi.de/entity/Q42738511994-01-13Paper
https://portal.mardi4nfdi.de/entity/Q42738381994-01-06Paper
https://portal.mardi4nfdi.de/entity/Q42738691994-01-06Paper
On the fractional matching polytope of a hypergraph1993-09-15Paper
Linkless embeddings of graphs in 3-space1993-06-29Paper
Excluding Infinite Trees1993-05-16Paper
Directed triangles in directed graphs1993-05-16Paper
On secret-sharing matroids1993-03-10Paper
A fractional version of the Erdős-Faber-Lovász conjecture1993-01-16Paper
Excluding Subdivisions of Infinite Cliques1993-01-16Paper
Excluding infinite minors1992-09-27Paper
An end-faithful spanning tree counterexample1992-09-27Paper
Disjoint Paths in a Planar Graph—A General Theorem1992-06-28Paper
Directed circuits on a torus1992-06-27Paper
A simpler proof and a generalization of the zero-trees theorem1992-06-27Paper
An End-Faithful Spanning Tree Counterexample1992-06-27Paper
Graph minors. X: Obstructions to tree-decomposition1992-06-26Paper
Quickly excluding a forest1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39729531992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39734101992-06-26Paper
Graph minors. IX: Disjoint crossed paths1992-06-25Paper
A Separator Theorem for Nonplanar Graphs1992-06-25Paper
Monotonicity in graph searching1992-06-25Paper
Graph minors. IV: Tree-width and well-quasi-ordering1990-01-01Paper
Graph minors. VIII: A Kuratowski theorem for general surfaces1990-01-01Paper
Colouring series-parallel graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33608831990-01-01Paper
Graphs with small bandwidth and cutwidth1989-01-01Paper
A counterexample to the rank-coloring conjecture1989-01-01Paper
Self-organizing sequential search and Hilbert's inequalities1988-01-01Paper
On induced subgraphs of the cube1988-01-01Paper
Graph minors. VII: Disjoint paths on a surface1988-01-01Paper
On the connectivity function of a matroid1988-01-01Paper
On Forbidden Minors for GF(3)1988-01-01Paper
Characterization of even directed graphs1987-01-01Paper
Large induced degenerate subgraphs1987-01-01Paper
The smallest n-uniform hypergraph with positive discrepancy1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37738821987-01-01Paper
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number1987-01-01Paper
Graph minors. VI. Disjoint paths across a disc1986-01-01Paper
Graph minors. V. Excluding a planar graph1986-01-01Paper
Triples in matroid circuits1986-01-01Paper
Adjacency in binary matroids1986-01-01Paper
Graph minors. II. Algorithmic aspects of tree-width1986-01-01Paper
Counting points in hypercubes and convolution measure algebras1985-01-01Paper
Minors of 3-connected matroids1985-01-01Paper
Disjoint Paths—A Survey1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841391985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374421985-01-01Paper
Graph minors. III. Planar tree-width1984-01-01Paper
A note on nongraphic matroids1984-01-01Paper
Averaging sets: A generalization of mean values and spherical designs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206371984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32222171984-01-01Paper
A generalization of chordal graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808751984-01-01Paper
Graph minors. I. Excluding a forest1983-01-01Paper
Packing nearly-disjoint sets1982-01-01Paper
On the points-lines-planes conjecture1982-01-01Paper
The Structure of Homometric Sets1982-01-01Paper
Multicommodity flows in planar graphs1981-01-01Paper
On Tutte's extension of the four-colour problem1981-01-01Paper
Nowhere-zero 6-flows1981-01-01Paper
Matroids and multicommodity flows1981-01-01Paper
On minors of non-binary matroids1981-01-01Paper
Even circuits in planar graphs1981-01-01Paper
Recognizing graphic matroids1981-01-01Paper
On Odd Cuts and Plane Multicommodity Flows1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39272641981-01-01Paper
Functions of Bounded Second Variation and Stieltjes-Type Integrals1981-01-01Paper
Decomposition of regular matroids1980-01-01Paper
Packing and covering with matroid circuits1980-01-01Paper
Disjoint paths in graphs1980-01-01Paper
Four-terminus flows1980-01-01Paper
On Tutte's Characterization of Graphic Matroids1980-01-01Paper
A short proof of the two-commodity flow theorem1979-01-01Paper
Matroid representation over GF(3)1979-01-01Paper
Solution of two fractional packing problems of Lovász1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39165951979-01-01Paper
On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte1979-01-01Paper
A two-commodity cut theorem1978-01-01Paper
Counterexample to a conjecture of Jeurissen1978-01-01Paper
Percolation Probabilities on the Square Lattice1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41985281978-01-01Paper
The matroids with the max-flow min-cut property1977-01-01Paper
A note on the production of matroid minors1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018381976-01-01Paper
The Forbidden Minors of Binary Clutters1976-01-01Paper
A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS1976-01-01Paper
Combinatorial applications of an inequality from statistical mechanics1975-01-01Paper
ON THE TWO-COLOURING OF HYPERGRAPHS1974-01-01Paper
A Note on a Combinatorial Problem of ErdŐS and Hajnal1974-01-01Paper
On incomparable collections of sets1973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


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