Katherine Edwards
ke at princeton dot edu
Room 313
Department of Computer Science
Princeton University
35 Olden Street, Princeton, NJ 08540-5233
I am a Ph.D. student at Princeton University.
I am interested in graph theory and combinatorial optimization, particularly structural graph theory and graph colouring. My advisor is Paul Seymour.
Before coming to Princeton, I got a B.Sc. and M.Sc. at McGill University where I worked in the discrete math group with Bruce Shepherd and others.
Preprints
Disjoint dijoins
[pdf]
Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul Seymour
Edge-colouring seven-regular planar graphs
[arXiv]
Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul Seymour
Edge-colouring eight-regular planar graphs
[arXiv]
Maria Chudnovsky, Katherine Edwards, Paul Seymour
A superlocal version of Reed's Conjecture
[arXiv]
Katherine Edwards, Andrew D. King
Published/accepted papers
Bounding the fractional chromatic number of
KΔ-free graphs
[arXiv]
Katherine Edwards, Andrew D. King
SIAM Journal of Discrete Mathematics, 27(2): 1184 - 1208, 2013.
A note on hitting maximum and maximal cliques with a stable set
[arXiv] [doi]
Demetres Christofides, Katherine Edwards, Andrew D. King
Journal of Graph Theory, 73(3): 354 - 360, 2013.
Conference papers
Partial interval set cover - trade-offs between scalability and optimality
[pdf]
Simon Griffiths, Katherine Edwards, W. Sean Kennedy
APPROX-RANDOM 2013, 110-125.
Theses
M.Sc. Thesis.
Optimization and Packings of T-joins and T-cuts.
[pdf]
