- Discrete Mathematics 235 (2001) 255269 www.elsevier.com/locate/disc
- COMBINATORICA Bolyai Society Springer-Verlag
- CS 4120 Analysis of Algorithms A term 2010
- Annals of Combinatorics 2 (1998) 43-60 Combinatorics
- Inequalities for the First-Fit Chromatic Number
- Ramsey-Type Results for Gallai Colorings
- CS 4120 Analysis of Algorithms A term 2010
- On cycles in the coprime graph of integers1 Mathematics Institute
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- CS 2022/ MA 2201 Discrete Mathematics A term 2010
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Combinatorics, Probability and Computing (2011) 20, 5371. c Cambridge University Press 2010 doi:10.1017/S0963548310000209
- Journal of Combinatorial Theory, Series B 96 (2006) 855873 www.elsevier.com/locate/jctb
- Discrete Mathematics 265 (2003) 237250 www.elsevier.com/locate/disc
- On edge colorings with at least q colors in every subset of p vertices
- CS 2022/ MA 2201 Discrete Mathematics A term 2010
- Cycles in Hypergraphs Gabor N. Sarkozy
- On the Regularity Method Gabor N. Sarkozy
- COMBINATORICA Bolyai Society -Springer-Verlag
- An Algorithmic Version of the Blow-Up Lemma
- On the Posa-Seymour Janos Komlos,1 Gabor N. Sarkozy, 2
- MATHEMATICS ELSEVIER Discrete Mathematics 195 (1999) 235-237
- On k-Ordered Hamiltonian H. A. Kierstead,1 G. N. Sarkozy,2 *and S. M. Selkow2
- Combinatorics, Probability and Computing (2001) 10, 397416. c 2001 Cambridge University Press DOI 10.1017/S0963548301004849 Printed in the United Kingdom
- Discrete Mathematics 305 (2005) 264275 www.elsevier.com/locate/disc
- On an Anti-Ramsey Problem of Burr, Erdos,
- COMBINATORICA Bolyai Society Springer-Verlag
- Tripartite Ramsey Numbers for Paths
- Journal of Combinatorial Theory, Series B 98 (2008) 342358 www.elsevier.com/locate/jctb
- Discrete Mathematics 308 (2008) 19621972 www.elsevier.com/locate/disc
- Discrete Mathematics 308 (2008) 26202622 www.elsevier.com/locate/disc
- Monochromatic Hamiltonian t-Tight
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Digital Object Identifier (DOI) 10.1007/s00373-008-0811-y Graphs and Combinatorics (2008) 24:531536
- Multipartite Ramsey Numbers for Odd Cycles
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Graphs and Combinatorics (2010) 26:7176 DOI 10.1007/s00373-010-0908-y
- AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 50 (2011), Pages 4553
- Spectral Clustering in Educational Data Mining SHUBHENDU TRIVEDI, ZACHARY A. PARDOS,
- Discrete Mathematics ( ) Contents lists available at ScienceDirect
- An improved bound for vertex partitions by connected monochromatic k-regular graphs
- Star versus two stripes Ramsey numbers and a conjecture of Schelp
- Coverings by few monochromatic pieces -a transition between two Ramsey problems
- CS 2022/ MA 2201 Discrete Mathematics A term 2010
- CS 2022/ MA 2201 Discrete Mathematics A term 2010
- CS 4120 Analysis of Algorithms A term 2010
- CS 4120 Analysis of Algorithms A term 2010
- CS 4120 Analysis of Algorithms A term 2010
- Journal of Combinatorial Theory, Series B 78, 115 122 (2000) Vertex Partitions by Connected Monochromatic
- Monochromatic Cycle Partitions of Edge-Colored
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- CS 2022/ MA 2201 Discrete Mathematics A term 2010
- Discrete Mathematics 297 (2005) 190195 www.elsevier.com/locate/disc
- CS 2022 / MA 2201 Discrete Mathematics A term 2010
- CS 4120 Analysis of Algorithms A term 2010
- 78 commuNicaTioNS of The acm | SePteMber 2009 | voL. 52 | No. 9 review articles
- CS 4120 Analysis of Algorithms A term 2010
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- An Application of the Regularity Lemma in
- Monochromatic Hamiltonian 3-Tight Berge
- One-Sided Coverings of Colored Complete Bipartite graphs
- MATHEMATICS Discrete Mathematics 202 (1999) 227-238
- COMBINATORICA Bolyai Society Springer-Verlag
- The Ramsey number of diamond-matchings and loose cycles in hypergraphs
- CS 503 Foundations of Computer Science Fall term 2011
- CS 503 Foundations of Computer Science Fall term 2011
- CS 503 Foundations of Computer Science Fall term 2011
- CS 503 Foundations of Computer Science Fall term 2011
- CS 503 Foundations of Computer Science Fall term 2011
- CS 503 Foundations of Computer Science 01/18-03/06 2012 at Cisco
- Coverings by few monochromatic pieces -a transition between two Ramsey problems
- p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011
- CS 503 Foundations of Computer Science 01/18-03/06 2012 at Cisco
