P. E. Haxell - Citegraph

Author Info

Name	Affiliation	Papers
P. E. HAXELL	Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada	27
Collaborators	Citations	PageRank
29	212	26.40
Referers	Referees	References
255	181	155

Search Limit

100255

Publications (27 rows)

Collaborators (29 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Goldberg's conjecture is true for random multigraphs	0	0.34	2019
Finding independent transversals efficiently	0	0.34	2018
A Note on Intersecting Hypergraphs with Large Cover Number.	1	0.40	2017
On lower bounds for the matching number of subcubic graphs	1	0.37	2017
Homological connectedness of random hypergraphs.	0	0.34	2017
Packing and covering tetrahedra	0	0.34	2013
On even-degree subgraphs of linear hypergraphs	0	0.34	2012
On the Stable Paths Problem	2	0.38	2010
The ramsey number for 3-uniform tight hypergraph cycles	9	0.63	2009
An Algorithmic Version of the Hypergraph Regularity Method	12	1.56	2008
An improved bound for the strong chromatic number	4	0.46	2008
A fractional model of the border gateway protocol (BGP)	11	0.83	2008
The Ramsey number for hypergraph cycles I	27	2.99	2006
On the Strong Chromatic Number	10	0.87	2004
On characterizing hypergraph regularity	10	1.30	2002
Tree embeddings	8	0.82	2001
Embedding trees into graphs of large girth	3	0.50	2000
Packing and covering triangles in graphs	10	0.98	1999
Packing and Covering Triangles in Tripartite Graphs	8	0.91	1998
Hypercubes and Multicommodity Flows	2	0.49	1997
Partitioning complete bipartite graphs by monochromatic cycles	28	2.74	1997
Atoms of set systems with a fixed number of pairwise unions	0	0.34	1996
Partitioning by monochromatic trees	13	2.25	1996
A condition for matchability in hypergraphs	27	3.02	1995
On an anti-Ramsey property of Ramanujan graphs	3	0.49	1995
Tura´n's extremal problem in random graphs: forbidding even cycles	23	2.05	1995
A note on a conjecture of Gallai	0	0.34	1995