Get started
Author

Penny E. Haxell

Observed names: Haxell, P.E, Haxell, Penny, P. E. HAXELL, P. E. Haxell, P. HAXELL, P. Haxell, P.E. Haxell, PENNY HAXELL, Penny Haxell
Observed institutions: Natural Sciences and Engineering Research Council of Canada, University of Waterloo, Universidade de São Paulo, Simon Fraser University, University of Cambridge, Graz University of Technology, Freie Universität Berlin
OpenAlex ID: A5073055503
Hall's theorem for hypergraphs
2000 · Ron Aharoni, Penny Haxell · Journal of Graph Theory · 133
A condition for matchability in hypergraphs
1995 · P. E. Haxell · Graphs and Combinatorics · 112
A Note on Vertex List Colouring
2001 · P. E. HAXELL · Combinatorics Probability Computing · 109
Integer and Fractional Packings in Dense Graphs
2001 · P. E. Haxell, V. Rödl · COMBINATORICA · 92
The Induced Size-Ramsey Number of Cycles
1995 · P. E. Haxell, Y. Kohayakawa, et al. · Combinatorics Probability Computing · 88
Turán′s Extremal Problem in Random Graphs: Forbidding Even Cycles
1995 · P.E. Haxell, Y. Kohayakawa, et al. · Journal of Combinatorial Theory Series B · 66
The Ramsey number for hypergraph cycles I
2005 · P.E. Haxell, T. Łuczak, et al. · Journal of Combinatorial Theory Series A · 61
PDF
Partitioning Complete Bipartite Graphs by Monochromatic Cycles
1997 · P.E. Haxell · Journal of Combinatorial Theory Series B · 60
PDF
Bounded size components—partitions and transversals
2003 · Penny Haxell, Tibor Szabó, et al. · Journal of Combinatorial Theory Series B · 55
Packing and covering triangles in graphs
1999 · P.E. Haxell · Discrete Mathematics · 53
Tree embeddings
2001 · P. E. Haxell · Journal of Graph Theory · 44
On the Strong Chromatic Number
2004 · P. E. HAXELL · Combinatorics Probability Computing · 41
The size-Ramsey number of trees
1995 · P. E. Haxell, Y. Kohayakawa · Israel Journal of Mathematics · 41
Tur�n's extremal problem in random graphs: Forbidding odd cycles
1996 · P. E. Haxell, Y. Kohayakawa, et al. · COMBINATORICA · 37
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
2009 · P. E. HAXELL, T. ŁUCZAK, et al. · Combinatorics Probability Computing · 33
PDF
How to Morph Planar Graph Drawings
2017 · Soroush Alamdari, Patrizio Angelini, et al. · SIAM Journal on Computing · 32
PDF
Partitioning by Monochromatic Trees
1996 · P.E. Haxell, Y. Kohayakawa · Journal of Combinatorial Theory Series B · 32
Odd Independent Transversals are Odd
2006 · PENNY HAXELL, TIBOR SZABÓ · Combinatorics Probability Computing · 27
Packing and Covering Triangles in Tripartite Graphs
1998 · P. E. Haxell, Y. Kohayakawa · Graphs and Combinatorics · 27
On Directed Triangles in Digraphs
2007 · Peter Hamburger, Penny Haxell, et al. · The Electronic Journal of Combinatorics · 26
PDF
Ramsey Numbers for Trees of Small Maximum Degree
2002 · P. E. Haxell, T. Łuczak, et al. · COMBINATORICA · 25
Packing and Covering Triangles in K 4-free Planar Graphs
2011 · Penny Haxell, Alexandr Kostochka, et al. · Graphs and Combinatorics · 23
A Note on Cycle Lengths in Graphs
2002 · R.J. Gould, P.E. Haxell, et al. · Graphs and Combinatorics · 23
On Forming Committees
2011 · P. Haxell · American Mathematical Monthly · 20
List Coloring Hypergraphs
2010 · Penny Haxell, Jacques Verstraete · The Electronic Journal of Combinatorics · 20
PDF
Works count: 107
Citation count: 1,708
H-index: 23
I10-index: 44
Year
Topic
Type