Graeme Kemkes

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Towards a Weighted Version of the Hajnal–Szemerédi Theorem	2013	József Balogh Graeme Kemkes Choongbum Lee Stephen J. Young
+ PDF Chat	An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph	2013	Graeme Kemkes Nicholas Wormald
+	Towards a weighted version of the Hajnal-Szemer\'edi Theorem	2012	József Balogh Graeme Kemkes Choongbum Lee Stephen J. Young
+ PDF Chat	Asymptotic enumeration of sparse 2‐connected graphs	2012	Graeme Kemkes Cristiane M. Sato Nicholas Wormald
+	Almost all cop-win graphs contain a universal vertex	2012	Anthony Bonato Graeme Kemkes Paweł Prałat
+	Towards a weighted version of the Hajnal-Szemerédi Theorem	2012	József Balogh Graeme Kemkes Choongbum Lee Stephen J. Young
+ PDF Chat	Independence and chromatic densities of graphs	2011	Anthony Bonato Jason I. Brown Graeme Kemkes Paweł Prałat
+	Asymptotic enumeration of sparse 2-connected graphs	2010	Graeme Kemkes Cristiane M. Sato Nicholas Wormald
+	Asymptotic enumeration of sparse 2-connected graphs	2010	Graeme Kemkes Cristiane M. Sato Nicholas Wormald
+	On the chromatic number of random d-regular graphs	2009	Graeme Kemkes Xavier Pérez‐Giménez Nicholas Wormald
+	None	2009	Josep Dı́az Alexis C. Kaporis Graeme Kemkes Lefteris M. Kirousis Xavier Pérez‐Giménez N. C. Wormald
+	On the chromatic number of a random 5‐regular graph	2009	Josep Dı́az Alexis C. Kaporis Graeme Kemkes Lefteris M. Kirousis Xavier Pérez‐Giménez N. C. Wormald
+	An improved upper bound on the length of the longest cycle of a supercritical random graph	2009	Graeme Kemkes Nicholas Wormald
+	Properties of random graphs	2008	Graeme Kemkes
+	On the chromatic number of random d-regular graphs	2008	Graeme Kemkes Xavier Pérez‐Giménez Nicholas Wormald
+	Stirling Numbers for Complex Arguments: Asymptotics and Identities	2003	Graeme Kemkes Chiu Fan Lee Donatella Merlini Bruce M. Richmond

Common Coauthors

Coauthor	Papers Together
Nicholas Wormald	7
Xavier Pérez‐Giménez	4
Cristiane M. Sato	3
Stephen J. Young	3
Choongbum Lee	3
József Balogh	3
Josep Dı́az	2
Paweł Prałat	2
Anthony Bonato	2
N. C. Wormald	2
Lefteris M. Kirousis	2
Alexis C. Kaporis	2
Bruce M. Richmond	1
Jason I. Brown	1
Chiu Fan Lee	1
Donatella Merlini	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs	1980	Béla Bollobás	7
+	Colouring Random 4-Regular Graphs	2006	Lingsheng Shi Nicholas Wormald	5
+	Almost all regular graphs are hamiltonian	1994	Robert W. Robinson N. C. Wormald	5
+	Models of Random Regular Graphs	1999	N. C. Wormald	5
+	Asymptotic enumeration of sparse graphs with a minimum degree constraint	2003	Boris Pittel Nicholas Wormald	5
+	Counting connected graphs inside-out	2004	Boris Pittel Nicholas Wormald	5
+ PDF Chat	The Chromatic Number of Random Regular Graphs	2004	Dimitris Achlioptas Cristopher Moore	4
+	Component behavior near the critical point of the random graph process	1990	Tomasz Łuczak	3
+	Sharp concentration of the chromatic number on random graphsG n, p	1987	Eli Shamir Joel Spencer	3
+ PDF Chat	5-Regular Graphs are 3-Colorable with Positive Probability	2005	Josep Dı́az George Grammatikopoulos Alexis C. Kaporis Lefteris M. Kirousis Xavier Pérez‐Giménez D. G. Sotiropoulos	3
+	Cycles in a random graph near the critical point	1991	Tomasz Łuczak	3
+	The longest path in a random graph	1981	Miklós Ajtai János Komlós Endre Szemerédi	3
+ PDF Chat	Some remarks on the theory of graphs	1947	P. Erdős	3
+	On large matchings and cycles in sparse random graphs	1986	Alan Frieze	3
+	Almost all cubic graphs are Hamiltonian	1992	Robert W. Robinson N. C. Wormald	3
+	The asymptotic distribution of short cycles in random regular graphs	1981	Nicholas Wormald	3
+	On the independence and chromatic numbers of random regular graphs	1992	Alan Frieze Tomasz Łuczak	2
+ PDF Chat	Encores on Cores	2006	J Cain Nicholas Wormald	2
+	On the chromatic number of random graphs	2008	Amin Coja‐Oghlan Κωνσταντίνος Παναγιώτου Angelika Steger	2
+	Colouring Random Regular Graphs	2006	LINGSHENG SHI Nicholas Wormald	2
+	The cop density of a graph	2007	Anthony Bonato Geňa Hahn Changping Wang	2
+ PDF Chat	Random<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>K</mml:mi></mml:math>-satisfiability problem: From an analytic solution to an efficient algorithm	2002	Marc Mézard Riccardo Zecchina	2
+ PDF Chat	The chromatic number of random graphs	1991	Tomasz Łuczak	2
+	Forbidden subgraphs in connected graphs	2004	Vlady Ravelomanana Loÿs Thimonier	2
+ PDF Chat	The minimum degree threshold for perfect graph packings	2009	Daniela Kühn Deryk Osthus	2
+	Asymptotic Enumeration Methods	1995	Andrew Odlyzko	2
+ PDF Chat	Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number	2002	Colin Cooper Alan Frieze Bruce Reed Oliver Riordan	2
+	On the strength of connectedness of a random graph	1964	P. Erdős A. Rényi	2
+ PDF Chat	Degrees giving independent edges in a hypergraph	1981	D. E. Daykin Roland Häggkvist	2
+ PDF Chat	The two possible values of the chromatic number of a random graph	2005	Dimitris Achlioptas Assaf Naor	2
+	None	2009	Josep Dı́az Alexis C. Kaporis Graeme Kemkes Lefteris M. Kirousis Xavier Pérez‐Giménez N. C. Wormald	2
+	The chromatic number of random graphs	1988	B Bollobás	2
+	The asymptotic number of labeled connected graphs with a given number of vertices and edges	1990	Edward A. Bender E. Rodney Canfield Brendan D. McKay	2
+ PDF Chat	Threshold values, stability analysis, and high-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>q</mml:mi></mml:math>asymptotics for the coloring problem on random graphs	2004	Florent Krząkała Andrea Pagnani Martin Weigt	2
+	A note on the sharp concentration of the chromatic number of random graphs	1991	Tomasz Łuczak	2
+	On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree	2009	Hiệp Hàn Yury Person Mathias Schacht	2
+	The Asymptotic Number of Labeled Graphs withnVertices,qEdges, and No Isolated Vertices	1997	Edward A. Bender E. Rodney Canfield Brendan D. McKay	2
+	Random regular graphs of non-constant degree: Concentration of the chromatic number	2009	Sonny Ben-Shimon Michael Krivelevich	2
+	The number of connected sparsely edged graphs	1977	E. M. Wright	2
+	ASYMPTOTIC APPROXIMATIONS TO INTEGRALS	1980		2
+ PDF Chat	The concentration of the chromatic number of random graphs	1997	Noga Alon Michael Krivelevich	2
+	Random regular graphs of high degree	2001	Michael Krivelevich Benny Sudakov Van H. Vu Nicholas Wormald	2
+	Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs	2005	Catherine Greenhill Oleg Pikhurko	1
+	The number of maximal independent sets in connected graphs	1987	Zoltán Füredi	1
+ PDF Chat	Further algorithmic aspects of the local lemma	1998	Michael Molloy Bruce Reed	1
+	3-star factors in random <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:mi>d</mml:mi></mml:math>-regular graphs	2006	Hilda Assiyatun Nicholas Wormald	1
+	Cops and robbers in a random graph	2012	Béla Bollobás Gábor Kun Imre Leader	1
+	On acyclic colorings of planar graphs	2006	O. V. Borodin	1
+ PDF Chat	Pursuit-Evasion in Models of Complex Networks	2007	Anthony Bonato Paweł Prałat Changping Wang	1
+ PDF Chat	A Note on Independent Sets in Trees	1988	Bruce E. Sagan	1