The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gábor N. Sárközy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gábor N. Sárközy, Stanley M. Selkow
    On bipartite generalized Ramsey theory. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:68, n:, pp:- [Journal]
  2. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    Blow-Up Lemma. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:109-123 [Journal]
  3. Gábor N. Sárközy, Stanley M. Selkow
    An Extension Of The Ruzsa-Szemerédi Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:25, n:1, pp:77-84 [Journal]
  4. Paul Erdös, Gábor N. Sárközy
    On cycles in the coprime graph of integers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  5. Gábor N. Sárközy, Stanley M. Selkow
    On Edge Colorings with at Least q Colors in Every Subset of p Vertices. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  6. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    Spanning Trees In Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal]
  7. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    proof of a Packing Conjecture of Bollobás. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:241-255 [Journal]
  8. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    Proof of the Alon-Yuster conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:255-269 [Journal]
  9. Gábor N. Sárközy, Stanley M. Selkow
    On a Turán-type hypergraph problem of Brown, Erdos and T. Sós. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:190-195 [Journal]
  10. András Sárközy, Gábor N. Sárközy
    On the size of partial block designs with large blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:305, n:1-3, pp:264-275 [Journal]
  11. Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi
    On the number of Hamiltonian cycles in Dirac graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:265, n:1-3, pp:237-250 [Journal]
  12. Gábor N. Sárközy, Stanley M. Selkow
    Vertex Partitions by Connected Monochromatic k-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:115-122 [Journal]
  13. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:855-873 [Journal]
  14. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    An algorithmic version of the blow-up lemma. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:297-312 [Journal]
  15. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    On the square of a Hamiltonian cycle in dense graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:193-211 [Journal]
  16. Gábor N. Sárközy, Stanley M. Selkow
    On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:147-156 [Journal]
  17. András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
    Three-Color Ramsey Numbers For Paths. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:35-69 [Journal]
  18. Gábor N. Sárközy
    Complete tripartite subgraphs in the coprime graph of integers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:202, n:1-3, pp:227-238 [Journal]
  19. Aron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow
    Counting irregular multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:235-237 [Journal]

  20. Three-color Ramsey numbers for paths. [Citation Graph (, )][DBLP]


  21. On 2-factors with k components. [Citation Graph (, )][DBLP]


  22. Size of monochromatic components in local edge colorings. [Citation Graph (, )][DBLP]


  23. Distributing vertices along a Hamiltonian cycle in Dirac graphs. [Citation Graph (, )][DBLP]


  24. A fast parallel algorithm for finding Hamiltonian cycles in dense graphs. [Citation Graph (, )][DBLP]


  25. Stability of the path-path Ramsey number. [Citation Graph (, )][DBLP]


  26. Gallai colorings of non-complete graphs. [Citation Graph (, )][DBLP]


  27. How to avoid using the Regularity Lemma: Pósa's conjecture revisited. [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002