Penny E. Haxell

From MaRDI portal
Person:353398

Available identifiers

zbMath Open haxell.penny-eWikidataQ21002304 ScholiaQ21002304MaRDI QIDQ353398

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61472902024-01-15Paper
Large cliques in graphs with high chromatic number2023-11-27Paper
A note on \(\Delta\)-critical graphs2023-11-07Paper
Algorithms for Weighted Independent Transversals and Strong Colouring2023-10-31Paper
Finding independent transversals efficiently2021-04-30Paper
Topological connectedness and independent sets in graphs2021-02-06Paper
Goldberg's conjecture is true for random multigraphs2019-07-17Paper
Morphing Schnyder drawings of planar triangulations2019-04-25Paper
A Stability Theorem for Matchings in Tripartite 3-Graphs2018-11-05Paper
Extremal hypergraphs for Ryser's conjecture2018-07-18Paper
Ramsey-nice families of graphs2018-06-28Paper
Homological connectedness of random hypergraphs2018-01-18Paper
A note on intersecting hypergraphs with large cover number2017-09-08Paper
On Lower Bounds for the Matching Number of Subcubic Graphs2017-07-05Paper
How to Morph Planar Graph Drawings2017-05-30Paper
Independent transversals and hypergraph matchings - an elementary approach2017-01-25Paper
Edge coloring multigraphs without small dense subsets2015-08-05Paper
Morphing Schnyder drawings of planar triangulations2015-01-07Paper
Packing and covering tetrahedra2013-11-29Paper
Primality of trees2013-07-30Paper
Tree-minimal graphs are almost regular2013-07-12Paper
Packing and covering triangles in \(K_{4}\)-free planar graphs2012-12-27Paper
Bounded transversals in multipartite graphs2012-07-10Paper
On Ryser's conjecture2012-06-12Paper
On Even-Degree Subgraphs of Linear Hypergraphs2012-05-14Paper
A stability theorem on fractional covering of triangles by edges2012-05-04Paper
On characterizing Vizing's edge colouring bound2012-02-08Paper
On Forming Committees2011-11-21Paper
A note on Schnyder's theorem2011-08-16Paper
On the Stable Paths Problem2011-06-17Paper
List coloring hypergraphs2010-10-13Paper
https://portal.mardi4nfdi.de/entity/Q35793942010-08-06Paper
Packing and covering triangles in planar graphs2010-05-05Paper
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles2010-04-23Paper
Large monochromatic components in colorings of complete 3-uniform hypergraphs2009-06-23Paper
On directed triangles in digraphs2009-04-07Paper
An Algorithmic Version of the Hypergraph Regularity Method2008-12-22Paper
An improved bound for the strong chromatic number2008-06-12Paper
Maximum acyclic and fragmented sets in regular graphs2008-02-13Paper
Integer and fractional packings in dense graphs2007-03-29Paper
Independent dominating sets and hamiltonian cycles2007-03-20Paper
The Ramsey number for hypergraph cycles. I.2006-03-16Paper
Odd Independent Transversals are Odd2006-03-13Paper
A note on the Size-Ramsey number of long subdivisions of graphs2005-06-07Paper
On the Strong Chromatic Number2005-02-18Paper
To Adrian Bondy and U.S.R. Murty.2004-03-15Paper
Bounded size components -- partitions and transversals.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44113892003-07-08Paper
Integer and fractional packings in dense 3‐uniform hypergraphs2003-05-11Paper
A note on cycle lengths in graphs2003-03-25Paper
On characterizing hypergraph regularity2003-03-19Paper
Ramsey numbers for trees of small maximum degree2002-11-03Paper
A Note on Vertex List Colouring2002-06-03Paper
https://portal.mardi4nfdi.de/entity/Q27125882001-08-27Paper
Embedding trees into graphs of large girth2001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q45183332001-03-04Paper
Packing and covering triangles in graphs2000-02-09Paper
https://portal.mardi4nfdi.de/entity/Q43702101999-04-25Paper
Packing and covering triangles in tripartite graphs1998-09-06Paper
Partitioning complete bipartite graphs by monochromatic cycles1997-08-03Paper
Hypercubes and Multicommodity Flows1997-05-26Paper
Partitioning by monochromatic trees1997-02-23Paper
Atoms of set systems with a fixed number of pairwise unions1996-07-02Paper
The Induced Size-Ramsey Number of Cycles1996-06-18Paper
Turán's extremal problem in random graphs: Forbidding odd cycles1996-05-14Paper
On an anti‐Ramsey property of Ramanujan graphs1996-01-28Paper
Turán's extremal problem in random graphs: Forbidding even cycles1995-12-18Paper
A condition for matchability in hypergraphs1995-10-31Paper
A note on a conjecture of Gallai1995-10-08Paper
The size-Ramsey number of trees1995-10-05Paper
A note on a conjecture of Ryser1995-07-02Paper
Counting interval orders1987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Penny E. Haxell