Paul Seymour (mathematician) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Paul Seymour (mathematician)" in English language version.

refsWebsite

Global rank English rank

27doi.org

2^nd place

10semanticscholar.org

11^th place

8^th place

6arxiv.org

69^th place

59^th place

4psu.edu

207^th place

136^th place

3princeton.edu

741^st place

577^th place

2jstor.org

26^th place

20^th place

1handle.net

102^nd place

76^th place

1ostrowski.ch

low place

1royalsociety.org

2,415^th place

2,060^th place

1wiley.com

222^nd place

297^th place

1springer.com

274^th place

309^th place

1sciencedirect.com

149^th place

178^th place

1bbc.co.uk

8^th place

10^th place

arxiv.org

Robertson, N.; Seymour, P.; Thomas, R. (1999). "Permanents, Pfaffian orientations, and even directed circuits". Annals of Mathematics. 150 (3): 929–975. arXiv:math/9911268. doi:10.2307/121059. JSTOR 121059. S2CID 7489315.
Chudnovsky, M.; Robertson, N.; Seymour, P.; Thomas, R. (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. S2CID 119151552.
Scott, A.; Seymour, P. (2016). "Induced subgraphs of graphs with large chromatic number. I. Odd holes". Journal of Combinatorial Theory, Series B. 121: 68–86. arXiv:1410.4118. doi:10.1016/j.jctb.2015.10.002. S2CID 52874586.
Chudnovsky, M.; Scott, A.; Seymour, P. (2017). "Induced subgraphs of graphs with large chromatic number. III. Long holes". Combinatorica. 37 (6): 1057–1072. arXiv:1506.02232. doi:10.1007/s00493-016-3467-x. S2CID 2560430.
Scott, A.; Seymour, P. (2019). "Induced subgraphs of graphs with large chromatic number. X. Holes with specific residue". Combinatorica. 39 (5): 1105–1132. arXiv:1705.04609. doi:10.1007/s00493-019-3804-y. S2CID 51746725.
Chudnovsky, M.; Scott, A.; Seymour, P.; Spirkl, S. (2023). "Erdős–Hajnal for graphs with no 5-hole". Proceedings of the London Mathematical Society. 126 (3): 997–1014. arXiv:2102.04994. doi:10.1112/plms.12504. S2CID 259380697.

bbc.co.uk

news.bbc.co.uk

"Cold virus to aid cancer patients". BBC News. 11 January 2007. Retrieved 18 September 2024.

doi.org

Seymour, P.D. (1977). "The matroids with the max-flow min-cut property". Journal of Combinatorial Theory, Series B. 23 (2–3): 189–222. doi:10.1016/0095-8956(77)90031-4.
Seymour, P.D. (1980). "Decomposition of regular matroids". Journal of Combinatorial Theory, Series B. 28 (3): 305–359. doi:10.1016/0095-8956(80)90075-1.
Seymour, P.D.; Welsh, D.J.A. (1978). "Percolation Probabilities on the Square Lattice". Annals of Discrete Mathematics. 3: 227–245. doi:10.1016/S0167-5060(08)70509-0. ISBN 9780720408430.
Seymour, P.D. (1979). "On multi-colourings of cubic graphs, and conjectures of Fulkerson and Tutte". Proceedings of the London Mathematical Society. 3 (3): 423–460. doi:10.1112/plms/s3-38.3.423.
Seymour, P.D. (1981). "Nowhere-zero 6-flows". Journal of Combinatorial Theory, Series B. 30 (2): 130–135. doi:10.1016/0095-8956(81)90058-7.
Seymour, P.D. (1980). "Disjoint paths in graphs". Discrete Mathematics. 29 (3): 293–309. doi:10.1016/0012-365X(80)90158-2.
Robertson, N.; Seymour, P. (1999). "Graph minors. XVII. Taming a vortex". Journal of Combinatorial Theory, Series B. 77 (1): 162–210. doi:10.1006/jctb.1999.1919.
Robertson, N.; Seymour, P. (2004). "Graph minors. XX. Wagner's conjecture". Journal of Combinatorial Theory, Series B. 92 (2): 325–357. doi:10.1016/j.jctb.2004.08.001.
Robertson, N.; Seymour, P. (2010). "Graph minors XXIII. Nash-Williams' immersion conjecture". Journal of Combinatorial Theory, Series B. 100 (2): 181–205. CiteSeerX 10.1.1.304.8831. doi:10.1016/j.jctb.2009.07.003.
Robertson, N.; Seymour, P. (1995). "Graph minors. XIII. The disjoint paths problem". Journal of Combinatorial Theory, Series B. 63 (1): 65–110. doi:10.1006/jctb.1995.1006.
Robertson, N.; Seymour, P.; Thomas, R. (1995). "Sachs' linkless embedding conjecture". Journal of Combinatorial Theory, Series B. 64 (2): 185–227. doi:10.1006/jctb.1995.1032.
Robertson, N.; Seymour, P.; Thomas, R. (1993). "Hadwiger's conjecture for $K_{6}$ -free graphs". Combinatorica. 13 (3): 279–361. doi:10.1007/BF01202354. S2CID 9608738.
Robertson, N.; Sanders, D.; Seymour, P.; Thomas, R. (1997). "The four-colour theorem". Journal of Combinatorial Theory, Series B. 70 (1): 2–44. doi:10.1006/jctb.1997.1750.
Robertson, N.; Seymour, P.; Thomas, R. (1999). "Permanents, Pfaffian orientations, and even directed circuits". Annals of Mathematics. 150 (3): 929–975. arXiv:math/9911268. doi:10.2307/121059. JSTOR 121059. S2CID 7489315.
Alon, N.; Seymour, P.; Thomas, R. (1990). "A separator theorem for nonplanar graphs". Journal of the American Mathematical Society. 3 (4): 801–808. doi:10.2307/1990903. JSTOR 1990903.
Seymour, P.; Thomas, R. (1993). "Graph searching and a min-max theorem for tree-width". Journal of Combinatorial Theory, Series B. 58 (1): 22–33. doi:10.1006/jctb.1993.1027.
Seymour, P.; Thomas, R. (1994). "Call routing and the ratcatcher". Combinatorica. 14 (2): 217–241. doi:10.1007/BF01215352. S2CID 7508434.
Chudnovsky, M.; Robertson, N.; Seymour, P.; Thomas, R. (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. S2CID 119151552.
Chudnovsky, M.; Cornuéjols, G; Liu, X.; Seymour, P.; Vus̆ković, K. (2005). "Recognizing Berge graphs". Combinatorica. 25 (2): 143–186. doi:10.1007/s00493-005-0012-8. S2CID 2229369.
Chudnovsky, M.; Seymour, P. (2008). "Claw-free graphs. V. Global structure". Journal of Combinatorial Theory, Series B. 98 (6): 1373–1410. CiteSeerX 10.1.1.125.1835. doi:10.1016/j.jctb.2008.03.002.
Oum, S.; Seymour, P. (2006). "Approximating clique-width and branch-width". Journal of Combinatorial Theory, Series B. 96 (4): 514–528. CiteSeerX 10.1.1.139.9829. doi:10.1016/j.jctb.2005.10.006.
Chudnovsky, M.; Seymour, P. (2007). "The roots of the independence polynomial of a clawfree graph". Journal of Combinatorial Theory, Series B. 97 (3): 350–357. CiteSeerX 10.1.1.118.3609. doi:10.1016/j.jctb.2006.06.001.
Scott, A.; Seymour, P. (2016). "Induced subgraphs of graphs with large chromatic number. I. Odd holes". Journal of Combinatorial Theory, Series B. 121: 68–86. arXiv:1410.4118. doi:10.1016/j.jctb.2015.10.002. S2CID 52874586.
Chudnovsky, M.; Scott, A.; Seymour, P. (2017). "Induced subgraphs of graphs with large chromatic number. III. Long holes". Combinatorica. 37 (6): 1057–1072. arXiv:1506.02232. doi:10.1007/s00493-016-3467-x. S2CID 2560430.
Scott, A.; Seymour, P. (2019). "Induced subgraphs of graphs with large chromatic number. X. Holes with specific residue". Combinatorica. 39 (5): 1105–1132. arXiv:1705.04609. doi:10.1007/s00493-019-3804-y. S2CID 51746725.
Chudnovsky, M.; Scott, A.; Seymour, P.; Spirkl, S. (2020). "Detecting an odd hole". Journal of the ACM. 67 (1): 12pp. doi:10.1145/3375720. hdl:10012/18527. S2CID 119705201.
Chudnovsky, M.; Scott, A.; Seymour, P.; Spirkl, S. (2023). "Erdős–Hajnal for graphs with no 5-hole". Proceedings of the London Mathematical Society. 126 (3): 997–1014. arXiv:2102.04994. doi:10.1112/plms.12504. S2CID 259380697.

handle.net

hdl.handle.net

Chudnovsky, M.; Scott, A.; Seymour, P.; Spirkl, S. (2020). "Detecting an odd hole". Journal of the ACM. 67 (1): 12pp. doi:10.1145/3375720. hdl:10012/18527. S2CID 119705201.

jstor.org

Robertson, N.; Seymour, P.; Thomas, R. (1999). "Permanents, Pfaffian orientations, and even directed circuits". Annals of Mathematics. 150 (3): 929–975. arXiv:math/9911268. doi:10.2307/121059. JSTOR 121059. S2CID 7489315.
Alon, N.; Seymour, P.; Thomas, R. (1990). "A separator theorem for nonplanar graphs". Journal of the American Mathematical Society. 3 (4): 801–808. doi:10.2307/1990903. JSTOR 1990903.

ostrowski.ch

Allyn Jackson. "Seymour Receives Ostrowski Prize" (PDF). Notices of the AMS. 51: 900.

princeton.edu

web.math.princeton.edu

Seymour, Paul. "Online Papers". Retrieved 26 April 2013.
"Paul Seymour's CV" (PDF). Retrieved 27 May 2022.

dof.princeton.edu

"Professorships | Dean of the Faculty".

psu.edu

citeseerx.ist.psu.edu

Robertson, N.; Seymour, P. (2010). "Graph minors XXIII. Nash-Williams' immersion conjecture". Journal of Combinatorial Theory, Series B. 100 (2): 181–205. CiteSeerX 10.1.1.304.8831. doi:10.1016/j.jctb.2009.07.003.
Chudnovsky, M.; Seymour, P. (2008). "Claw-free graphs. V. Global structure". Journal of Combinatorial Theory, Series B. 98 (6): 1373–1410. CiteSeerX 10.1.1.125.1835. doi:10.1016/j.jctb.2008.03.002.
Oum, S.; Seymour, P. (2006). "Approximating clique-width and branch-width". Journal of Combinatorial Theory, Series B. 96 (4): 514–528. CiteSeerX 10.1.1.139.9829. doi:10.1016/j.jctb.2005.10.006.
Chudnovsky, M.; Seymour, P. (2007). "The roots of the independence polynomial of a clawfree graph". Journal of Combinatorial Theory, Series B. 97 (3): 350–357. CiteSeerX 10.1.1.118.3609. doi:10.1016/j.jctb.2006.06.001.

royalsociety.org

"Outstanding scientists elected as Fellows and Foreign Members of the Royal Society". Retrieved 11 May 2022.

sciencedirect.com

"Journal of Combinatorial Theory, Series B Editorial Board". Retrieved 27 May 2022.

semanticscholar.org

api.semanticscholar.org

Robertson, N.; Seymour, P.; Thomas, R. (1993). "Hadwiger's conjecture for $K_{6}$ -free graphs". Combinatorica. 13 (3): 279–361. doi:10.1007/BF01202354. S2CID 9608738.
Robertson, N.; Seymour, P.; Thomas, R. (1999). "Permanents, Pfaffian orientations, and even directed circuits". Annals of Mathematics. 150 (3): 929–975. arXiv:math/9911268. doi:10.2307/121059. JSTOR 121059. S2CID 7489315.
Seymour, P.; Thomas, R. (1994). "Call routing and the ratcatcher". Combinatorica. 14 (2): 217–241. doi:10.1007/BF01215352. S2CID 7508434.
Chudnovsky, M.; Robertson, N.; Seymour, P.; Thomas, R. (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. S2CID 119151552.
Chudnovsky, M.; Cornuéjols, G; Liu, X.; Seymour, P.; Vus̆ković, K. (2005). "Recognizing Berge graphs". Combinatorica. 25 (2): 143–186. doi:10.1007/s00493-005-0012-8. S2CID 2229369.
Scott, A.; Seymour, P. (2016). "Induced subgraphs of graphs with large chromatic number. I. Odd holes". Journal of Combinatorial Theory, Series B. 121: 68–86. arXiv:1410.4118. doi:10.1016/j.jctb.2015.10.002. S2CID 52874586.
Chudnovsky, M.; Scott, A.; Seymour, P. (2017). "Induced subgraphs of graphs with large chromatic number. III. Long holes". Combinatorica. 37 (6): 1057–1072. arXiv:1506.02232. doi:10.1007/s00493-016-3467-x. S2CID 2560430.
Scott, A.; Seymour, P. (2019). "Induced subgraphs of graphs with large chromatic number. X. Holes with specific residue". Combinatorica. 39 (5): 1105–1132. arXiv:1705.04609. doi:10.1007/s00493-019-3804-y. S2CID 51746725.
Chudnovsky, M.; Scott, A.; Seymour, P.; Spirkl, S. (2020). "Detecting an odd hole". Journal of the ACM. 67 (1): 12pp. doi:10.1145/3375720. hdl:10012/18527. S2CID 119705201.
Chudnovsky, M.; Scott, A.; Seymour, P.; Spirkl, S. (2023). "Erdős–Hajnal for graphs with no 5-hole". Proceedings of the London Mathematical Society. 126 (3): 997–1014. arXiv:2102.04994. doi:10.1112/plms.12504. S2CID 259380697.