Penelope Evelyn Haxell is a Canadian mathematician who works as a professor in the department of combinatorics and optimization at the University of Waterloo.
Her research interests include extremal combinatorics and graph theory.
[2][3] Since then, she has worked at the University of Waterloo, where she was promoted to full professor in 2004.
[2] Haxell's research accomplishments include results on the Szemerédi regularity lemma, hypergraph generalizations of Hall's marriage theorem (see Haxell's matching theorem), fractional graph packing problems, and strong coloring of graphs.
[2] Haxell was the 2006 winner of the Krieger–Nelson Prize of the Canadian Mathematical Society.