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.[1]

Education and career

Haxell earned a bachelor's degree in 1988 from the University of Waterloo, and completed a doctorate in 1993 from the University of Cambridge under the supervision of Béla Bollobás.[2][3] Since then, she has worked at the University of Waterloo, where she was promoted to full professor in 2004.[2]

Research

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]

Recognition

Haxell was the 2006 winner of the Krieger–Nelson Prize of the Canadian Mathematical Society.[2]

References

  1. ^ "Penny Haxell", Combinatorics and Optimization people profiles, University of Waterloo, April 14, 2015, retrieved September 13, 2015.
  2. ^ a b c d Four honoured for outstanding research achievements, Canadian Mathematical Society, May 3, 2005, retrieved September 13, 2015.
  3. ^ Penny Haxell at the Mathematics Genealogy Project
Categories