Henry A. Kiersteád

Generating author description...

All published works

Action	Title	Year	Authors
+	Improved upper bounds on longest-path and maximal subdivision transversals	2023	Henry A. Kiersteád Eric Ren
+	A sharp Dirac-Erd\H{o}s type bound for large graphs	2017	Henry A. Kiersteád Alexandr Kostochka Andrew McConvey
+	A sharp Dirac-Erdős type bound for large graphs	2017	Henry A. Kiersteád Alexandr Kostochka Andrew McConvey
+	Strengthening theorems of Dirac and Erd\H{o}s on disjoint cycles	2016	Henry A. Kiersteád Alexandr Kostochka Andrew McConvey
+	Strengthening theorems of Dirac and Erdős on disjoint cycles	2016	Henry A. Kiersteád Alexandr Kostochka Andrew McConvey
+ PDF Chat	The (2k-1)-connected multigraphs with at most k-1 disjoint cycles	2015	Henry A. Kiersteád Alexandr Kostochka Elyse Yeager
+ PDF Chat	A fast algorithm for equitable coloring	2010	Henry A. Kiersteád Alexandr Kostochka Marcelo Mydlarz Endre Szemerédi
+	Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture	2010	Henry A. Kiersteád Alexandr Kostochka
+ PDF Chat	Planar graph coloring with an uncooperative partner	1993	Henry A. Kiersteád William T. Trotter
+ PDF Chat	Hypergraphs With Finitely Many Isomorphism Subtypes	1989	Henry A. Kiersteád Peter Nyikos
+ PDF Chat	Hypergraphs with finitely many isomorphism subtypes	1989	Henry A. Kiersteád Peter Nyikos
+	On <i>Π</i><sub>1</sub>-automorphisms of recursive linear orders	1987	Henry A. Kiersteád
+	On <i>Π</i><sub>1</sub>-automorphisms of recursive linear orders	1987	Henry A. Kiersteád
+	The chromatic number of graphs which induce neither K1,3 nor K5−e	1986	Henry A. Kiersteád James H. Schmerl
+	Metakides G. and Nerode A.. Recursion theory and algebra. Algebra and logic, Papers from the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia, edited by Crossley J. N., Lecture notes in mathematics, vol. 450, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 209–219.Kalantari Iraj and Retzlaff Allen. Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces. The journal of symbolic logic, vol. …	1986	Henry A. Kiersteád
+	Inequalities for the greedy dimensions of ordered sets	1985	Henry A. Kiersteád William T. Trotter
+	Some applications of Vizing's theorem to vertex colorings of graphs	1983	Henry A. Kiersteád James H. Schmerl
+	An Effective Version of Dilworth's Theorem	1981	Henry A. Kiersteád
+ PDF Chat	An effective version of Dilworth’s theorem	1981	Henry A. Kiersteád
+	Countable models of ω1-categorical theories in admissible languages	1980	Henry A. Kiersteád
+	A multiplateau extension of the lacher theory	1980	Henry A. Kiersteád

Common Coauthors

Coauthor	Papers Together
Alexandr Kostochka	7
Andrew McConvey	4
James H. Schmerl	2
William T. Trotter	2
Peter Nyikos	2
Endre Szemerédi	1
Elyse Yeager	1
Eric Ren	1
Marcelo Mydlarz	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	An Ore-type theorem on equitable coloring	2007	H. A. Kierstead Alexandr Kostochka	3
+ PDF Chat	Some Results Concerning the Structure of Graphs	1963	G. A. Dirac	3
+ PDF Chat	The infamous upper tail	2002	Svante Janson Andrzej Ruciński	2
+	On the Existence of Disjoint Cycles in a Graph	1998	Hikoe Enomoto	2
+	A Decomposition Theorem for Partially Ordered Sets	2009	R. P. Dilworth	2
+	Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma	1999	Vojtěch Rödl Andrzej Ruciński	2
+	On the maximum number of independent cycles in a graph	1999	Hong Wang	2
+	Minimum degree conditions for vertex-disjoint even cycles in large graphs	2014	Shuya Chiba Shinya Fujita Ken‐ichi Kawarabayashi Tadashi Sakuma	2
+ PDF Chat	A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring	2007	H. A. Kierstead Alexandr Kostochka	2
+	Spanning subgraphs of random graphs	1992	Noga Alon Zoltán Füredi	2
+	Combinatorial theory and its applications	1970	Colloquium on Combinatorial Theory P. Erdős Alfréd Rényi Vera T. Sós Bolyai János Matematikai Társulat	2
+	Domain decomposition: Parallel multilevel methods for elliptic partial differential equations	1997	Barry Smith Petter E. Bjørstad William Gropp	2
+ PDF Chat	Ore-type graph packing problems	2006	Alexandr Kostochka Gexin Yu	1
+ PDF Chat	Theories with a finite number of models in an uncountable power are categorical	1975	A. H. Lachlan	1
+ PDF Chat	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	1
+	Note on Choudum's “chromatic bounds for a class of graphs”	1980	Medha Javdekar	1
+	Categoricity in ℵ1 of sentences in $$L_{\omega _1 ,\omega } (Q)$$	1975	Saharon Shelah	1
+	CHROMATIC BOUNDS FOR A CLASS OF GRAPHS	1977	S.A. Choudum	1
+	Equitable Coloring and the Maximum Degree	1994	Bor-Liang Chen Ko‐Wei Lih Pou-Lin Wu	1
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi	1
+	Greedy linear extensions to minimize jumps	1985	Mohamed H. El-Zahar Ivan Rival	1
+ PDF Chat	Recursive Euler and Hamilton paths	1976	Dwight R. Bean	1
+	On equitable coloring of bipartite graphs	1996	Ko‐Wei Lih Pou-Lin Wu	1
+	An upper bound on the “dimension of interval orders”	1978	Issie Rabinovitch	1
+	Order Types of Real Numbers and Other Uncountable Orderings	1982	James E. Baumgartner	1
+ PDF Chat	Inequalities in dimension theory for posets	1975	William T. Trotter	1
+	On strongly minimal sets	1971	John T. Baldwin A. H. Lachlan	1
+	Ramsey's theorem and recursion theory	1972	Carl G. Jockusch	1
+	Equitable Coloring Extends Chernoff-Hoeffding Bounds	2001	Sriram V. Pemmaraju	1
+ PDF Chat	Ore-type versions of Brooks' theorem	2008	H. A. Kierstead Alexandr Kostochka	1
+	On equitable <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>Δ</mml:mi></mml:math>-coloring of graphs with low average degree	2005	Alexandr Kostochka Kittikorn Nakprasit	1
+	Countable models of ℵ1-categorical theories	1967	Michael Morley	1
+	Dimension Theory for Ordered Sets	1982	David Kelly William T. Trotter	1
+	On the Corrádi–Hajnal theorem and a question of Dirac	2016	H. A. Kierstead Alexandr Kostochka Elyse Yeager	1
+	Independent Directed Triangles in a Directed Graph.	2000	Hong Wang	1
+	On the Corrádi-Hajnal Theorem and a question of Dirac	2016	H. A. Kierstead Alexandr Kostochka Elyse Yeager	1
+	On directed versions of the Corrádi–Hajnal corollary	2014	Andrzej Czygrinow H. A. Kierstead Theodore Molla	1
+ PDF Chat	On Directed Versions of the Hajnal–Szemerédi Theorem	2015	Andrew Treglown	1
+ PDF Chat	AlmostH-factors in dense graphs	1992	Noga Alon Raphael Yuster	1
+	On Some Aspects of my Work with Gabriel Dirac	1988	Paul Erdős	1
+	Extermal problems in dimension theory for partially ordered sets	1973	Robert J. Kimble	1
+	Saturated Model Theory	2009	Gerald E. Sacks	1
+	Equitable colorings extend Chernoff-Hoeffding bounds	2001	Sriram V. Pemmaraju	1
+	Irreducible posets with large height exist	1974	William T. Trotter	1
+	A proof of dilworth’s decomposition theorem for partially ordered sets	1963	Micha A. Perles	1
+	Some applications of Vizing's theorem to vertex colorings of graphs	1983	Henry A. Kiersteád James H. Schmerl	1
+	A minimal prime model with an infinite set of indiscernibles	1972	Leo Marcus	1
+	A weak version of ◊ which follows from 2ℵ 0<2ℵ 1	1978	Keith Devlin Saharon Shelah	1
+	H-Factors in Dense Graphs	1996	Noga Alon Raphael Yuster	1
+	An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications	1977	Michael Makkai	1