Gabor Sarkozy
Title
Cited by
Cited by
Year
Blow-up lemma
J Komlós, GN Sárközy, E Szemerédi
Combinatorica 17 (1), 109-123, 1997
2951997
Proof of the Alon–Yuster conjecture
J Komlós, G Sárközy, E Szemerédi
Discrete Mathematics 235 (1-3), 255-269, 2001
1402001
Proof of the Seymour conjecture for large graphs
J Komlós, GN Sárközy, E Szemerédi
Annals of Combinatorics 2 (1), 43-60, 1998
1221998
Three-color Ramsey numbers for paths
A Gyárfás, M Ruszinkó, GN Sárközy, E Szemerédi
Combinatorica 27 (1), 35-69, 2007
1072007
An algorithmic version of the blow‐up lemma
J Komlós, GN Sarkozy, E Szemerédi
Random Structures & Algorithms 12 (3), 297-312, 1998
961998
On the square of a Hamiltonian cycle in dense graphs
J Komlós, GN Sárközy, E Szemerédi
Random Structures & Algorithms 9 (1‐2), 193-211, 1996
861996
On the Pósa‐Seymour conjecture
J Komlós, GN Sárközy, E Szemerédi
Journal of Graph Theory 29 (3), 167-176, 1998
841998
An improved bound for the monochromatic cycle partition number
A Gyárfás, M Ruszinkó, GN Sárközy, E Szemerédi
Journal of Combinatorial Theory, Series B 96 (6), 855-873, 2006
792006
Ramsey‐type results for Gallai colorings
A Gyárfás, GN Sárközy, A Sebő, S Selkow
Journal of Graph Theory 64 (3), 233-243, 2010
722010
Proof of a packing conjecture of Bollobás
J Komlós, GN Sárközy, E Szemerédi
Combinatorics, Probability and Computing 4 (3), 241-255, 1995
571995
How to avoid using the regularity lemma: Pósa’s conjecture revisited
I Levitt, GN Sárközy, E Szemerédi
Discrete Mathematics 310 (3), 630-641, 2010
502010
Spanning trees in dense graphs
J Komlós, GN Sárkózy, E Szemerédi
Combinatorics, Probability & Computing 10 (5), 397, 2001
502001
Spectral clustering in educational data mining
S Trivedi, Z Pardos, G Sárközy, N Heffernan
Educational Data Mining 2011, 2010
492010
On k‐ordered Hamiltonian graphs
HA Kierstead, GN Sárközy, SM Selkow
Journal of Graph Theory 32 (1), 17-25, 1999
441999
Partitioning -Colored Complete Graphs into Three Monochromatic Cycles
A Gyárfás, M Ruszinkó, GN Sárközy, E Szemerédi
the electronic journal of combinatorics 18 (1), P53, 2011
402011
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
A Gyárfás, J Lehel, GN Sárközy, RH Schelp
Journal of Combinatorial Theory, Series B 98 (2), 342-358, 2008
402008
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
J Balogh, J Barát, D Gerbner, A Gyárfás, GN Sárközy
Combinatorica 34 (5), 507-526, 2014
372014
An extension of the Ruzsa-Szemerédi theorem
GN Sárközy, S Selkow
Combinatorica 25 (1), 77-84, 2004
372004
Clustered knowledge tracing
ZA Pardos, S Trivedi, NT Heffernan, GN Sárközy
International Conference on Intelligent Tutoring Systems, 405-410, 2012
332012
Gallai colorings of non-complete graphs
A Gyárfás, GN Sárközy
Discrete Mathematics 310 (5), 977-980, 2010
312010
The system can't perform the operation now. Try again later.
Articles 1–20