Maria Chudnovsky

Maria Chudnovsky (b. January 6, 1977) is a Ph.D. candidate in mathematics at Princeton University who has made significant contributions to the field of combinatorics and graph theory. While at Princeton, she recently solved — in collaboration with thesis advisor Paul Seymour, Ohio State University Mathematics Professor Neil Robertson, and Georgia Institute of Technology Professor Robin Thomas — the Strong Perfect Graph Conjecture, one of the best known open problems in combinatorics, and is currently working on a problem related to this break-through for her dissertation.

• Personal webpage
• Curriculum Vitae
• Research Statement
• Interview

Selected Papers

• The strong perfect graph theorem with Neil Robertson, Paul Seymour, Robin Thomas