P. Mark Kayll

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	On Colouring Oriented Graphs of Large Girth	2023	P. Mark Kayll Michael B. Morris
+	On colouring oriented graphs of large girth	2023	P. Mark Kayll Michael B. Morris
+ PDF Chat	Uniquely $D$-Colourable Digraphs with Large Girth II: Simplification via Generalization	2021	P. Mark Kayll Esmaeil Parsa
+	On random digraphs and cores	2021	Esmaeil Parsa P. Mark Kayll
+	On random digraphs and cores.	2021	Esmaeil Parsa P. Mark Kayll
+	On lengths of burn-off chip-firing games	2020	P. Mark Kayll Dave Perkins
+	Uniquely $D$-colourable digraphs with large girth II: simplification via generalization	2020	P. Mark Kayll Esmaeil Parsa
+	A chip-firing variation and a Markov chain with uniform stationary distribution.	2017	Dave Perkins P. Mark Kayll
+	Two Chromatic Conjectures: One for Vertices and One for Edges	2016	P. Mark Kayll
+ PDF Chat	A chip-firing variation and a new proof of Cayley's formula	2013	P. Mark Kayll Dave Perkins
+ PDF Chat	Uniquely <i>D</i>-colourable Digraphs with Large Girth	2011	Ararat Harutyunyan P. Mark Kayll Bojan Mohar Liam Rafferty
+	Integrals Don’t Have Anything to Do with Discrete Math, Do They?	2011	P. Mark Kayll
+	König–Egerváry Graphs are Non-Edmonds	2010	P. Mark Kayll
+	Another short proof of the Joni-Rota-Godsil integral formula for counting bipartite matchings	2009	Erin E. Emerson P. Mark Kayll
+	A note on weak Sidon sequences	2005	P. Mark Kayll
+	The circular chromatic number of a digraph	2004	Drago Bokal Gašper Fijavž Martin Juvan P. Mark Kayll Bojan Mohar
+	On pebbling threshold functions for graph sequences	2002	Andrzej Czygrinow Nancy Eaton Glenn Hurlbert P. Mark Kayll
+	Asymptotically good choice numbers of multigraphs.	2001	P. Mark Kayll
+	MATH 581.01: Combinatorics	2000	P. Mark Kayll
+	On the stochastic independence properties of hard-core distributions	1997	Jeff Kahn P. Mark Kayll
+	Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size	1997	Jeff Kahn P. Mark Kayll
+	Asymptotics of the total chromatic number for simple graphs	1996	P. Mark Kayll
+	Asymptotically Good Covers in Hypergraphs: Extended Abstract of the Dissertation	1995	P. Mark Kayll

Common Coauthors

Coauthor	Papers Together
Esmaeil Parsa	4
Dave Perkins	3
Bojan Mohar	2
Michael B. Morris	2
Jeff Kahn	2
Liam Rafferty	1
Ararat Harutyunyan	1
Erin E. Emerson	1
Glenn Hurlbert	1
Martin Juvan	1
Nancy Eaton	1
Andrzej Czygrinow	1
Gašper Fijavž	1
Drago Bokal	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On sparse graphs with given colorings and homomorphisms	2003	Jaroslav Nešetřil Xuding Zhu	4
+	On chromatic number of finite set-systems	1968	László Lovász	4
+ PDF Chat	Graph Theory and Probability	1959	Paul Erdős	4
+ PDF Chat	Uniquely Colourable Graphs with Large Girth	1976	Béla Bollobás Norbert Sauer	4
+	Asymptotics of the Chromatic Index for Multigraphs	1996	Jeff Kahn	4
+	Algebraic Graph Theory	2009	Chris Godsil Gordon Royle	3
+	None	2004	Dan Archdeacon Joanna A. Ellis-Monaghan David Fisher Dalibor Fronček P. C. B. Lam Suzanne M. Seager Bing Wei Raphael Yuster	3
+	Maximum matching and a polyhedron with 0,1-vertices	1965	Jack Edmonds	3
+	A short construction of highly chromatic digraphs without short cycles	2014	Michael Severino	3
+	The circular chromatic number of a digraph	2004	Drago Bokal Gašper Fijavž Martin Juvan P. Mark Kayll Bojan Mohar	3
+	A Construction of Uniquely $n$-Colorable Digraphs with Arbitrarily Large Digirth	2017	Michael Severino	3
+	On colorings of graphs without short cycles	1979	Veronika Müller	3
+ PDF Chat	On the combinatorial problems which I would most like to see solved	1981	P. Erdős	2
+	Extremal Graph Theory	1978	Béla Bollobás	2
+	Hypergraphs - Combinatorics of Finite Sets	1989	Claude Berge	2
+	Some recent results on convex polytopes	1990	Carl W. Lee	2
+ PDF Chat	Theory of monomer-dimer systems	1972	Ole J. Heilmann Élliott H. Lieb	2
+	Ahypergraph-free construction of highly chromatic graphs without short cycles	1989	Igor Kříž	2
+	Matchings and covers in hypergraphs	1988	Zoltán Füredi	2
+	Graph Theory and Probability	2009	P. Erdős	2
+	Quadratic dynamical systems	1992	Yuri Rabinovich Alistair Sinclair Avi Wigderson	2
+	Ten Lectures on the Probabilistic Method	1994	Joel Spencer	2
+	Quadratic Dynamical Systems (Preliminary Version)	1992	Yuri Rabinovich Alistair Sinclair Avi Wigderson	2
+	An Introduction to Combinatorial Analysis	1958	R. A. Leibler John Riordan	2
+	Chip-firing games, potential theory on graphs, and spanning trees	2012	Matthew Baker Farbod Shokrieh	2
+	None	2003	Dominique Bénard A. Bouchet R. Bruce Richter	2
+	Hermite polynomials and a duality relation for matchings polynomials	1981	Chris Godsil	2
+	Location of the zeros of the partition function for some classical lattice systems	1970	H. Russell Kunz	2
+ PDF Chat	Theory of monomer-dimer systems	1972	Ole J. Heilmann Élliott H. Lieb	2
+	Asymptotically Good List-Colorings	1996	Jeff Kahn	2
+	The chip-firing game	2005	Criel Merino	2
+	On the stochastic independence properties of hard-core distributions	1997	Jeff Kahn P. Mark Kayll	2
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si37.gif" display="inline" overflow="scroll"><mml:mi>G</mml:mi></mml:math>-parking functions, acyclic orientations and spanning trees	2010	Brian Benson Deeparnab Chakrabarty Prasad Tetali	2
+	Percolation and the hard-core lattice gas model	1994	van den Hans Berg Jeffrey E. Steif	2
+ PDF Chat	Coloring, sparseness and girth	2016	Noga Alon Alexandr Kostochka Benjamin Reiniger Douglas B. West Xuding Zhu	2
+	Ten lectures on the probabilistic method	1987	Joel Spencer	2
+ PDF Chat	None	1999	N. L. Biggs	2
+	Combinatorics: topics, techniques, algorithms	1995	Peter J‎. Cameron	2
+	Chip-firing Games on Graphs	1991	Anders Björner László Lovász Peter W. Shor	2
+	Coloring nearly-disjoint hypergraphs with n + o(n) colors	1992	Jeff Kahn	1
+ PDF Chat	A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture	2004	Lucien Haddad Claude Tardif	1
+	Asymptotic packing and the random greedy algorithm	1996	Vojt ch R�dl Lubo Thoma	1
+	A new upper bound for the list chromatic number	1989	B Bollobás H.R. Hind	1
+	Some upper bounds on the total and list chromatic numbers of multigraphs	1992	Roland Häggkvist Amanda G. Chetwynd	1
+ PDF Chat	Edge and Total Choosability of Near-Outerplanar Graphs	2006	Timothy J. Hetherington Douglas R. Woodall	1
+ PDF Chat	An addition theorem on the integers modulo n	1989	Paul Lemke Daniel J. Kleitman	1
+	Chip firing and the tutte polynomial	1997	Criel Merino	1
+	On the Sandpile Group of Dual Graphs	2000	Robert Cori Dominique Rossin	1
+	A note on list‐colorings	1989	Amanda G. Chetwynd Roland Häggkvist	1
+	The Erdős–Faber–Lovász conjecture for dense hypergraphs	2007	Abdón Sánchez-Arroyo	1