Stanley M. Selkow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems	2013	András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+	Coverings by few monochromatic pieces - a transition between two Ramsey problems	2013	András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+	Coverings by few monochromatic pieces - a transition between two Ramsey problems	2013	András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+	An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs	2012	Gábor N. Sárközy Stanley M. Selkow Fei Song
+	Vertex partitions of non-complete graphs into connected monochromatic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-regular graphs	2011	Gábor N. Sárközy Stanley M. Selkow Fei Song
+	None	2010	András Gyárfás Gábor N. Sárközy András Sebő Stanley M. Selkow
+	Ramsey‐type results for Gallai colorings	2009	András Gyárfás Gábor N. Sárközy András Sebö Stanley M. Selkow
+	None	2008	Zoltán Füredi András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+	Inequalities for the first‐fit chromatic number	2008	Zoltán Füredi András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+	Distributing vertices along a Hamiltonian cycle in Dirac graphs	2008	Gábor N. Sárközy Stanley M. Selkow
+ PDF Chat	On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós	2006	Gábor N. Sárközy Stanley M. Selkow
+	On a Turán-type hypergraph problem of Brown, Erdős and T. Sós	2005	Gábor N. Sárközy Stanley M. Selkow
+	An Extension Of The Ruzsa-Szemer�di Theorem	2004	G�bor N. S�rk�zy Stanley M. Selkow
+ PDF Chat	The complexity of the certification of properties of Stable Marriage	2004	Daniel J. Dougherty Stanley M. Selkow
+	An application of the regularity lemma in generalized Ramsey theory	2003	Gábor N. Sárközy Stanley M. Selkow
+ PDF Chat	On the number of Hamiltonian cycles in Dirac graphs	2003	Gábor N. Sárközy Stanley M. Selkow Endre Szemerédi
+	On a question of Gowers concerning isosceles right-angle triangles	2003	Gábor N. Sárközy Stanley M. Selkow
+	On bipartite generalized Ramsey theory.	2003	Gábor N. Sárközy Stanley M. Selkow
+ PDF Chat	On Edge Colorings with at Least q Colors in Every Subset of p Vertices	2000	Gábor N. Sárközy Stanley M. Selkow
+	Vertex Partitions by Connected Monochromatic k-Regular Graphs	2000	Gábor N. Sárközy Stanley M. Selkow
+	On k-ordered Hamiltonian graphs	1999	H. A. Kierstead Gábor N. Sárközy Stanley M. Selkow
+ PDF Chat	On k‐ordered Hamiltonian graphs	1999	H. A. Kierstead Gábor N. Sárközy Stanley M. Selkow
+	Onk-ordered Hamiltonian graphs	1999	H. A. Kierstead G. N. S�rk�zy Stanley M. Selkow
+	Counting irregular multigraphs	1999	Aron C. Atkins Gábor N. Sárközy Stanley M. Selkow
+	The enumeration of labeled graphs by number of cutpoints	1998	Stanley M. Selkow
+	A characterization of n-component graphs	1996	C. Christen Giovanni Coray Stanley M. Selkow
+	On $k$-ordered Hamiltonian Graphs	1996	Gábor N. Sárközy Stanley M. Selkow
+	A Probabilistic lower bound on the independence number of graphs	1994	Stanley M. Selkow
+	The independence number of graphs in terms of degrees	1993	Stanley M. Selkow
+	On Some Conjectures of Gould on the Parities of the Binomial Coefficients	1981	Robert Garfinkel Stanley M. Selkow
+	New bounds for the clique number of a graph	1978	Stanley M. Selkow

Common Coauthors

Coauthor	Papers Together
Gábor N. Sárközy	22
András Gyárfás	5
H. A. Kierstead	3
Fei Song	2
András Gyárfás	2
G. N. S�rk�zy	1
András Sebő	1
András Sebő	1
Robert Garfinkel	1
Zoltán Füredi	1
Endre Szemerédi	1
Aron C. Atkins	1
Daniel J. Dougherty	1
Giovanni Coray	1
Zoltán Füredi	1
G�bor N. S�rk�zy	1
C. Christen	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Extremal Graph Theory	1978	Béla Bollobás	8
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi	6
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits	5
+	Vertex coverings by monochromatic cycles and trees	1991	Péter L. Erdős András Gyárfás L. Pyber	5
+	Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles	1998	Tomasz Łuczak Vojtěch Rödl Endre Szemerédi	4
+	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	2009	Stéphane Bessy Stéphan Thomassé	4
+	Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles	2008	Peter Allen	4
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi	4
+ PDF Chat	Three-color Ramsey numbers for paths	2008	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	3
+	On Ramsey-Type Problems	2009	Edy Tri Baskoro	3
+	Partitioning Complete Bipartite Graphs by Monochromatic Cycles	1997	Penny Haxell	3
+	On maximal paths and circuits of graphs	1959	P. Erdős Т. Галлаи	3
+	An algorithmic version of the blow-up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	3
+	On coloring graphs to maximize the proportion of multicolored k-edges	1968	Paul Erdős Daniel J. Kleitman	3
+	The Ramsey number for a triple of long even cycles	2006	Agnieszka Figaj Tomasz Łuczak	3
+	Graph Pairs and their Entropies: Modularity Problems	2000	János Körner Gábor Simonyi	2
+	Lambda composition	1997	Kathie Cameron Jack Edmonds	2
+	Handbook of Combinatorics	1995	Ronald Graham Martin Grötschel László Lovász	2
+	On the square of a Hamiltonian cycle in dense graphs	1996	J�nos Koml�s G�bor N. S�rk�zy Endre Szemer�di	2
+	Covering Complete Graphs by Monochromatic Paths	1989	András Gyárfás	2
+	Recent results on generalized Ramsey theory for graphs	1972	Frank Harary	2
+ PDF Chat	On an extremal problem in graph theory	1964	Péter L. Erdős	2
+ PDF Chat	Domination in colored complete graphs	1989	P. Erdős Ralph J. Faudree András Gyárfás R. H. Schelp	2
+ PDF Chat	Generalizing the Ramsey Problem through Diameter	2001	Dhruv Mubayi	2
+	Hypergraph Packing and Graph Embedding	1999	V. Rödl Andrzej Ruciński Anusch Taraz	2
+	Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma	1999	Vojtěch Rödl Andrzej Ruciński	2
+	One-sided Coverings of Colored Complete Bipartite Graphs	2007	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	2
+ PDF Chat	Edge colorings of complete graphs without tricolored triangles	2004	András Gyárfás Gábor Simony	2
+	THREE-COLOR RAMSEY NUMBERS FOR PATHS	2007	Mikl ́ Os O Ruszink G ́ Abor	2
+	Three-Color Ramsey Numbers For Paths	2007	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	2
+	Vertex Partitions by Connected Monochromatic k-Regular Graphs	2000	Gábor N. Sárközy Stanley M. Selkow	2
+	Proof of a Packing Conjecture of Bollobás	1995	János Komlós Gábor N. Sárközy Endre Szemerédi	2
+	Ramsey numbers for multiple copies of complete graphs	1978	Peter Lorimer R. J. Segedin	2
+	Perfect couples of graphs	1992	János Körner Gábor Simonyi Zsolt Tuza	2
+	Vertex coverings by monochromatic paths and cycles	1983	András Gyárfás	2
+	Size of Monochromatic Double Stars in Edge Colorings	2008	András Gyárfás Gábor N. Sárközy	2
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2014	Alexey Pokrovskiy	2
+	Extremal problems in graph theory	1997	Christopher M. Hartman	2
+	A variant of the classical Ramsey problem	1997	Paul Erdős András Gyárfás	2
+	A generalization of Ramsey theory for graphs	1978	Kai-Min Chung C.L. Liu	2
+	Über eine Eigenschaft der ebenen Komplexe	1937	Klaus W. Wagner	2
+	Edge-colored complete graphs with precisely colored subgraphs	1983	Fan Chung R. L. Graham	2
+ PDF Chat	The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs	2008	András Gyárfás Gábor N. Sárközy Endre Szemerédi	2
+ PDF Chat	Generalized Ramsey numbers for paths in<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="$2$"><mml:mn>2</mml:mn></mml:math>-chromatic graphs	1985	R. Meenakshi P. S. Sundararaghavan	2
+ PDF Chat	The Ramsey number for stripes	1975	E. J. Cockayne Peter Lorimer	2
+	An improved bound for the monochromatic cycle partition number	2006	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	2
+	Finding Large p-Colored Diameter Two Subgraphs	1999	Paul Erdo ̋s T.B. Fowler	2
+	Dense Graphs without 3-Regular Subgraphs	1995	L. Pyber V. Rödl Endre Szemerédi	2
+ PDF Chat	Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles	2011	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	2
+	Distance constraints in graph color extensions	2006	Joan P. Hutchinson Emily H. Moore	1