User:Wierdcowman/sandbox

Points for focus: -	What he teaches: Professor half in the department of mathematics, half in the program In applied and computational math.

-	Research team Maria Chudnovsky (now affiliated with Columbia) and Robin Thomas

-	Current work With his research team, they are currently working on the structures of graphs with certain induced subgraphs that are forbidden. Examples of these are perfect graphs, even-hole-free graphs, and claw-free graphs.

-	his research (briefly mention topics he has worked on) He has published papers on the topics of: the strong perfect graph theorem, recognizing Berge graphs, the roots of the independence polynomial of a claw-free graph, Graph minors, Claw-free graphs, counting paths in digraphs, Detecting even holes, how the proof of the strong perfect graph was found, the structure of claw-free graphs, and more recently submitted for publication simplicial cliques in claw-free graphs, and edge-colouring eight-regular planar graphs.

-	Mention the topics that will be the focus what is added to the page and why - even hole free graphs (no research just a mention)

-	perfect graphs What is a perfect graph? What research he has done on perfect graphs What has been proven about perfect graphs

-	the claw What is the claw? (mentioned in class) What research he has done about the claw. What has he proven about the claw and its impact

-	edge coloring Chosen because it relates to what we have done in class What is a planar graph? About edge colouring the eight-regular planar graphs

-	Summarize the work he has put in and where it is going Mention work with colleagues again Mention the afformentioned topics Conclude with the mention of the vast amount of research, and the vast amount of work, combined with the fact that there is still likely more to come.

References: 1)	Edge-Colouring Eight-Regular Planar Graphs by Maria Chudnovsky, Katherine Edwards, and Paul Seymour 2)	The Structure of Claw-Free Graphs by Maria Chudnovsky and Paul Seymour Other papers and references that might be used located at: https://web.math.princeton.edu/~pds/online.html

Also to edit page on graph coloring, the section of edge coloring with the information about the edge coloring of an eight regular planar graph.

About Paul Seymour: Paul Seymour is currently a professor at Princeton University; half in the department of mathematics and half in the program in applied and computational math. He has been working with Maria Chudnovsky, of Columbia University, and Robin Thomas, of the Georgia Institute of Technology, on graph theory research. The research is on the structures of graphs with certain induced subgraphs that are forbidden. Examples of these are perfect graphs, even-hole-free graphs, and claw-free graphs. Paul Seymour has worked with many mathematicians and has published papers on a wide variety of graph theory topics, such as the Strong Perfect Graph Theorem, Recognizing Berge Graphs, the Roots of the Independence Polynomial of a Claw-Free Graph, Graph Minors, Claw-Free Graphs, Counting Paths in Digraphs, Detecting Even Holes, How the Proof of the Strong Perfect Graph Was Found, and the Structure of Claw-Free Graphs. More recently he has submitted for publication papers on the topics of Simplicial Cliques in Claw-Free Graphs, and Edge-Colouring Eight-Regular Planar Graphs. Each of these papers is available for viewing and download on Paul Seymour’s Princeton page.

Paul Seymour's Work With Perfect Graphs
The work Paul Seymour and others have done with perfect graphs has proven the strong perfect graph theorem. The definition of a perfect graph is stated as: a graph, G, is perfect if for every induced subgraph H of G, the chromatic number of H equals the size of the largest clique of H. (A clique is a subset of vertices in the graph such that every two vertices are connected by an edge.) The research done on perfect graphs by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas was to prove the strong perfect graph theorem. This theorem was originally one of 2 conjectures that were proposed by Claude Berge in 1961. The first of these conjectures is: the compliment of every perfect graph is perfect, this is known as the weak perfect graph theorem. The second conjecture is; a graph is perfect if and only if it is Berge. This was proven in the paper "The Strong Perfect Graph Theorem." For a graph to be Berge, the graph, G, has to have no induced subgraph of G that is an odd cycle of length at least five or the complement of one. By proving this second conjecture true, it is now known as the strong perfect graph theorem.

Paul Seymour's Work With The Claw
A graph is said to be claw-free if no vertex has three pairwise nonadjacent neighbors. To understand the vast amount of research that was done by Paul Seymour on the claw-free graph, it is essential to know this definition. Because the term’s definition leaves open the possibility for many graphs to be considered claw-free, there were many papers published by Paul Seymour and others on this topic. The research done on claw-free graphs involves determining their structure. In order to provide a structural description of this graph, a series of papers was published by Paul Seymour and Maria Chudnovsky. The papers proved traits involving special types of claw-free graphs such as Orientable and Non-Orientable prismatic graphs, Circular interval graphs , the Decomposition theorem , a Global structure of the claw-free graph, colourings of claw-free graphs, Quasi-line graphs ,and also Simplicial Cliques in claw-free graphs. This research on the claw-free graph has proven that there is a complete structure of the graph. This has been proven in the paper titled "The Structure of claw-free Graphs" by Paul Seymour and Maria Chudnovsky.

Paul Seymour's Work With Edge Coloring
Along with Maria Chudnovsky and Katherine Edwards, Paul Seymour proved a theorem on Edge-colouring eight-regular planar graphs. A planar graph is a graph that can be embedded in the plane such that its edges intersect only at its endpoints. A proper edge-colouring is defined as an assignment of colors to the edges of the graph such that no two adjacent edges have the same colour. Finally, an eight-regular graph is a graph for which however many vertices are in the graph, each vertex is of degree eight. The research done in the paper "Edge-Colouring Eight-Regular Planar Graphs" proves that this graph can be coloured with eight colors. But it is hopeful that this research will be used to prove the conjecture of the paper; If G is a d-regular planar graph, then G is d-edge-colourable if and only if G is oddly d-edge-connected. This conjecture has been proven true for edge colouring d-regular planar graphs with up to eight edges. An edge colouring for a d-regular planar graph with nine edges has yet to be proven. According to the paper published on edge-colouring eight-regular planar graphs, it is more difficult to figure out.

For the other page: A current conjecture in this field is that if G is a d-regular planar graph, then G is d-edge-colourable if and only if G is oddly d-edge-connected. This conjecture is yet to be proven a theorem. But mathematicians are one step closer because of the work done by Maria Chudnovsky, Katherine Edwards, and Paul Seymour. Together they wrote a paper titled "Edge-Colouring Eight-Regular Planar Graphs" where they prove that an eight-regular planar graph has a chromatic number of eight. An eight-regular graph is a graph where each vertex has a degree of eight. Furthermore a planar graph is a graph that can be drawn on the plane with no crossed edges. By proving how to edge colour a d-regular planar graph where d is equal to eight, Chudnovsky, Edwards, and Seymour hope to build towards a proof for their conjecture on edge coloring a d-regular planar graph. Furthermore a d-regular planar graph with three edges is coulourable. This was proven in the four-colour theorem by Kenneth Appel and Wolfgang Haken in 1976. They proved the theorem by using computers. Additionally, a d-regular planar graph with four or five edges is also colourable. These were both proven by Guenin as mentioned in "Edge-Colouring Eight-Regular Planar Graphs". It was also stated that a d-regular planar graph with six edges is also colourable. This was proven by Zdenek Dvorak, Ken-ichi Kawarabayashi and Daniel Král. Kawarabayashi along with Chudnovsky, Edwards, and Seymour were able to prove how to edge-colour a seven-regular planar graph. Each of these proofs help to build on the idea of how to edge-colour a d-regular planar graph. The more d-regular planar graphs that are edge-colourable, the closer mathematicians are to proving how to colour any d-regular planar graph. Lastly, Chudnovsky, Edwards, and Paul Seymour have attempted to prove nine-regular planar graphs are edge colourable. They have yet to accomplish this because it appears to be much more difficult that the eight-regular case. The above are my first drafts. I need to add more to each of them and clean up the grammar before I am able to upload them to current wiki pages.

About Paul Seymour: Paul D. Seymour (born July 26, 1950) is currently a professor at Princeton University; half in the department of mathematics and half in the program in applied and computational math. His research interest is in discrete mathematics, especially combinatorics, graph theory, and optimization. He was responsible for pioneering breakthroughs on regular matroids and totally unimodular matrices, the four colour theorem, graph minors and structure, the strong perfect graph theorem, the Hadwiger conjecture, and claw-free graphs. He won the Fulkerson Prize in 1979, 1994, 2006 and 2009, the Pólya Prize in 1983 and 2004, the Ostrowski Prize in 2004, and the Sloan Fellowship in 1983. He has also received an honorary doctorate from University of Waterloo in 2008 and an honarary doctorate from Technical University of Denmark in 2013.

Career: From 1974-1976 he was a college research fellow at University College of Swansea. From 1976-1980 he was a Junior Research Fellow at Merton College, Oxford. He became an associate and a full professor at Ohio State University, Columbus, Ohio, in between 1980 and 1983. From 1984 until 1996, he was at Bell Labs, then Bellcore (Bell Communications Research) Morristown, New Jersey (now Telcordia Technologies). He was also an adjunct professor at Rutgers University from 1984-1987 and at University of Waterloo from 1988-1993. He became professor at Princeton University in 1996. He is Editor-in-Chief for the Journal of Graph Theory.

Major Contributions: Seymour has made vast contributions to the field of graph theory. His major contributions involve his work with claw-free graphs, strong perfect graphs, and edge colouring. The contributions to claw-free graphs stem from his collaborations with Maria Chudnovsky. Together, they were able to prove, in a series of papers, a structure of the claw-free graph by proving the structures of different types of these graphs and using those to determine the overall structure. The papers proved traits involving special types of claw-free graphs such as Orientable and Non-Orientable prismatic graphs, Circular interval graphs , the Decomposition theorem , a Global structure of the claw-free graph, colourings of claw-free graphs, Quasi-line graphs ,and also Simplicial Cliques in claw-free graphs. This research on the claw-free graph has proven that there is a complete structure of the graph. This has been proven in the paper titled "The Structure of claw-free Graphs" by Paul Seymour and Maria Chudnovsky.

The contributions to strong perfect graphs come from the proof of the strong perfect graph theorem proven in the paper "The Strong Perfect Graph Theorem".Along with his collaborators, they were able to prove that a graph is perfect if and only if the graph, G, has no induced subgraph of G that is an odd cycle of length at least five or the complement of one. Finally, along with collaborators, Paul Seymour has conjectured that if G is a d-regular planar graph, then G is d-edge-colourable if and only if G is oddly d-edge-connected. This is only a conjecture because they have yet to be able to prove it, but there has been work done towards proving this conjecture. The most recent work was published in a paper titled "Edge-Colouring Eight-Regular Planar Graphs" where they prove that an eight-regular planar graph has a chromatic number of eight. An eight-regular graph is a graph where each vertex has a degree of eight. Furthermore a planar graph is a graph that can be drawn on the plane with no crossed edges. With these definitions in mind, by proving how to edge colour a d-regular planar graph where d is equal to eight, Seymour and his collaborators hope to build towards a proof for their conjecture on edge coloring a d-regular planar graph. Finally, they have attempted to prove nine-regular planar graphs are edge colourable, but were unable to because it appears to be much more difficult than the eight-regular case.