2008 |
27 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
Three-color Ramsey numbers for paths.
Combinatorica 28(4): 499-502 (2008) |
26 | EE | Gábor N. Sárközy:
On 2-factors with k components.
Discrete Mathematics 308(10): 1962-1972 (2008) |
25 | EE | András Gyárfás,
Gábor N. Sárközy:
Size of monochromatic components in local edge colorings.
Discrete Mathematics 308(12): 2620-2622 (2008) |
24 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discrete Mathematics 308(23): 5757-5770 (2008) |
23 | EE | András Gyárfás,
Jenö Lehel,
Gábor N. Sárközy,
Richard H. Schelp:
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
J. Comb. Theory, Ser. B 98(2): 342-358 (2008) |
22 | EE | Paul Dorbec,
Sylvain Gravier,
Gábor N. Sárközy:
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.
Journal of Graph Theory 59(1): 34-44 (2008) |
21 | EE | 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.
Journal of Graph Theory 59(1): 75-88 (2008) |
2007 |
20 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
Three-Color Ramsey Numbers For Paths.
Combinatorica 27(1): 35-69 (2007) |
19 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
Tripartite Ramsey numbers for paths.
Journal of Graph Theory 55(2): 164-174 (2007) |
2006 |
18 | EE | András Gyárfás,
Miklós Ruszinkó,
Gábor N. Sárközy,
Endre Szemerédi:
An improved bound for the monochromatic cycle partition number.
J. Comb. Theory, Ser. B 96(6): 855-873 (2006) |
17 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós.
Journal of Graph Theory 52(2): 147-156 (2006) |
2005 |
16 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós.
Discrete Mathematics 297(1-3): 190-195 (2005) |
15 | EE | András Sárközy,
Gábor N. Sárközy:
On the size of partial block designs with large blocks.
Discrete Mathematics 305(1-3): 264-275 (2005) |
2004 |
14 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
An Extension Of The Ruzsa-Szemerédi Theorem.
Combinatorica 25(1): 77-84 (2004) |
2003 |
13 | | Gábor N. Sárközy,
Stanley M. Selkow:
On bipartite generalized Ramsey theory.
Ars Comb. 68: (2003) |
12 | EE | Gábor N. Sárközy,
Stanley M. Selkow,
Endre Szemerédi:
On the number of Hamiltonian cycles in Dirac graphs.
Discrete Mathematics 265(1-3): 237-250 (2003) |
2001 |
11 | | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
Spanning Trees In Dense Graphs.
Combinatorics, Probability & Computing 10(5): (2001) |
10 | EE | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
Proof of the Alon-Yuster conjecture.
Discrete Mathematics 235(1-3): 255-269 (2001) |
9 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
On Edge Colorings with at Least q Colors in Every Subset of p Vertices.
Electr. J. Comb. 8(1): (2001) |
2000 |
8 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
Vertex Partitions by Connected Monochromatic k-Regular Graphs.
J. Comb. Theory, Ser. B 78(1): 115-122 (2000) |
1999 |
7 | EE | Aron C. Atkins,
Gábor N. Sárközy,
Stanley M. Selkow:
Counting irregular multigraphs.
Discrete Mathematics 195(1-3): 235-237 (1999) |
6 | EE | Gábor N. Sárközy:
Complete tripartite subgraphs in the coprime graph of integers.
Discrete Mathematics 202(1-3): 227-238 (1999) |
1998 |
5 | | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
An algorithmic version of the blow-up lemma.
Random Struct. Algorithms 12(3): 297-312 (1998) |
1997 |
4 | | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
Blow-Up Lemma.
Combinatorica 17(1): 109-123 (1997) |
3 | EE | Paul Erdös,
Gábor N. Sárközy:
On cycles in the coprime graph of integers.
Electr. J. Comb. 4(2): (1997) |
1996 |
2 | | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
On the square of a Hamiltonian cycle in dense graphs.
Random Struct. Algorithms 9(1-2): 193-211 (1996) |
1995 |
1 | | János Komlós,
Gábor N. Sárközy,
Endre Szemerédi:
proof of a Packing Conjecture of Bollobás.
Combinatorics, Probability & Computing 4: 241-255 (1995) |