Penny Haxell
#66,837
Most Influential Person Now
Canadian mathematician
Penny Haxell's AcademicInfluence.com Rankings
Penny Haxellmathematics Degrees
Mathematics
#3186
World Rank
#4757
Historical Rank
Combinatorics
#53
World Rank
#59
Historical Rank
Measure Theory
#4318
World Rank
#5083
Historical Rank
Download Badge
Mathematics
Why Is Penny Haxell Influential?
(Suggest an Edit or Addition)According to Wikipedia, 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.
Penny Haxell's Published Works
Published Works
- Hall's theorem for hypergraphs (2000) (145)
- A condition for matchability in hypergraphs (1995) (114)
- A Note on Vertex List Colouring (2001) (98)
- Integer and Fractional Packings in Dense Graphs (2001) (90)
- The Induced Size-Ramsey Number of Cycles (1995) (86)
- Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles (1995) (69)
- Partitioning Complete Bipartite Graphs by Monochromatic Cycles, (1997) (57)
- The Ramsey number for hypergraph cycles I (2006) (57)
- Packing and covering triangles in graphs (1999) (56)
- Bounded size components--partitions and transversals (2003) (54)
- Turán's extremal problem in random graphs: Forbidding odd cycles (1996) (53)
- Tree embeddings (2001) (51)
- The size-Ramsey number of trees (1995) (45)
- On Directed Triangles in Digraphs (2007) (43)
- On the Strong Chromatic Number (2004) (40)
- Partitioning by Monochromatic Trees (1996) (35)
- How to Morph Planar Graph Drawings (2016) (34)
- Independent dominating sets and hamiltonian cycles (2007) (31)
- Packing and Covering Triangles in K4-free Planar Graphs (2012) (29)
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles (2009) (28)
- Packing and Covering Triangles in Tripartite Graphs (1998) (28)
- Ramsey Numbers for Trees of Small Maximum Degree (2002) (27)
- On Ryser's conjecture (2012) (26)
- An improved bound for the strong chromatic number (2008) (26)
- An algorithmic version of the hypergraph regularity method (2005) (25)
- A stability theorem on fractional covering of triangles by edges (2012) (25)
- A fractional model of the border gateway protocol (BGP) (2008) (23)
- List Coloring Hypergraphs (2010) (21)
- Odd Independent Transversals are Odd (2006) (21)
- Primality of trees (2011) (21)
- A Note on Cycle Lengths in Graphs (2002) (20)
- On characterizing hypergraph regularity (2002) (19)
- A note on a conjecture of Ryser (1995) (18)
- THE RAMSEY NUMBER FOR HYPERGRAPH CYCLES II (2007) (18)
- Maximum acyclic and fragmented sets in regular graphs (2008) (16)
- On Forming Committees (2011) (16)
- Packing and Covering Triangles in Planar Graphs (2009) (16)
- Morphing Schnyder Drawings of Planar Triangulations (2014) (15)
- A note on the Size-Ramsey number of long subdivisions of graphs (2005) (15)
- Integer and fractional packings in dense 3‐uniform hypergraphs (2003) (15)
- Counting interval orders (1987) (14)
- Wide-Sense Nonblocking WDM Cross-Connects (2002) (14)
- Extremal Hypergraphs for Ryser's Conjecture: Home-Base Hypergraphs (2013) (13)
- Morphing Planar Graph Drawings with Unidirectional Moves (2014) (13)
- On Lower Bounds for the Matching Number of Subcubic Graphs (2014) (12)
- Tree-minimal graphs are almost regular (2012) (11)
- Large monochromatic components in colorings of complete 3-uniform hypergraphs (2009) (10)
- A Note on Intersecting Hypergraphs with Large Cover Number (2016) (10)
- On list coloring Steiner triple systems (2009) (10)
- On the Anti-Ramsey Property of Ramanujan Graphs (1995) (10)
- Finding independent transversals efficiently (2018) (9)
- Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs (2013) (9)
- Embedding trees into graphs of large girth (2000) (8)
- On Even-Degree Subgraphs of Linear Hypergraphs (2012) (7)
- On characterizing Vizing's edge colouring bound (2012) (7)
- Edge coloring multigraphs without small dense subsets (2015) (6)
- Hypercubes and Multicommodity Flows (1997) (6)
- Extremal hypergraphs for Ryser's Conjecture (2018) (6)
- On the Stable Paths Problem (2010) (6)
- Goldberg's conjecture is true for random multigraphs (2018) (6)
- Algorithms for Weighted Independent Transversals and Strong Colouring (2019) (5)
- Independent transversals and hypergraph matchings - an elementary approach (2016) (5)
- On Defect Sets in Bipartite Graphs (Extended Abstract) (1997) (3)
- Ramsey-nice families of graphs (2017) (3)
- A Note on Schnyder’s Theorem (2016) (3)
- A note on a conjecture of Gallai (1995) (3)
- To Adrian Bondy and U. S. R. Murty (2004) (2)
- Packing and covering tetrahedra (2013) (2)
- A Stability Theorem for Matchings in Tripartite 3-Graphs (2017) (2)
- On defect sets in bipartite graphs (1997) (2)
- Morphing Schnyder Drawings of Planar Triangulations (2018) (2)
- Bounded transversals in multipartite graphs (2012) (2)
- Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole (2022) (1)
- Topological connectedness and independent sets in graphs (2019) (1)
- Homological connectivity of random hypergraphs (2016) (1)
- Homological connectedness of random hypergraphs (2017) (1)
- Packing and Covering Triangles in K4-free Planar Graphs (2011) (1)
- 2 THE REGULARITY METHOD 3 2 . 2 The counting lemma (0)
- Large cliques in graphs with high chromatic number (2022) (0)
- N ov 2 01 8 Finding Independent Transversals Efficiently (2018) (0)
- Mini-Workshop: Hypergraph Turán Problem (2012) (0)
- Title : How to Morph Planar Graph Drawings (2018) (0)
- TR-2011-007 Tree-minimal graphs are almost regular (2011) (0)
- Atoms of set systems with a fixed number of pairwise unions (1996) (0)
- Methods and Challenges in Extremal and Probabilistic Combinatorics ∗ Organizers (2015) (0)
- Sparse Pseudorandom Objects (2010) (0)
This paper list is powered by the following services:
Other Resources About Penny Haxell
What Schools Are Affiliated With Penny Haxell?
Penny Haxell is affiliated with the following schools: