- Gábor Sárközy
 Address: 1111 Budapest, Kende u. 13-17.Room number: K 619Phone: +36 1 279 6217E-mail: gsarkozyEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.hu
Publications[ order by time]
[ order by categories ]
[ order by authors]
- Long rainbow cycles in proper edge-colorings of complete graphs.
- Partitioning 3-colored complete graphs into three monochromatic cycles.
- The 3-colour Ramsey number of a 3-uniform Berge cycle.
Authors: Gyárfás, András; Sárközy, GáborDate: 2011.Published by: Combinatorics, Probability and Computing (Volume no.: 20, Issue no.: 1, Page: 53-71.)
- Long rainbow cycles in proper edge-colorings of complete graphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs.
Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, EndreDate: 2010.Published by: Annals of Combinatorics (Volume no.: 14, Issue no.: 2, Page: 245-249.)
- Ramsey-type results for Gallai colorings.
Authors: Gyárfás, András; Sárközy, Gábor; Sebő, András; Selkow, S.Date: 2010.Published by: Journal of Graph Theory (Volume no.: 64, Issue no.: 3, Page: 233-243.)
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs.
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
- Size of Monochromatic double stars in edge colorings
- Gallai colorings of non-complete graphs.
- Stability of the path-path Ramsey number.
- The Ramsey number of diamond matchings and loose cycles in hypergraphs.
Authors: Gyárfás, András; Sárközy, Gábor; Szemeredi , EndreDate: 2008.Published by: Electronic Journal of Combinatorics (Volume no.: 15, Page: #R126)
- Inequalities for the first-fit chromatic number.
Authors: Füredi, Zoltán; Gyárfás, András; Sárközy, Gábor; Selkow, StanleyDate: 2008.Published by: Journal of Graph Theory (Volume no.: 59, Page: 75-88.)
- Three-color Ramsey numbers for paths.
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
- Tripartite Ramsey numbers for paths.
- Three-color Ramsey numbers for paths.
- One-sided coverings of colored complete bipartite graphs
Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, EEditor: Klazar, MDate: 2006.Published by: Topics in discrete mathematics. Dedicated to Jarik Nešetril on the occasion of his 60th birthday. (Algorithms and combinatorics 26.) (Page: 133-154)
- An improved bound for the monochromatic cycle partition number
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
Authors: Sárközy, GN; Seklow, SDate: 2005.Published by: DISCRETE MATHEMATICS (Volume no.: 297, Issue no.: 1-3, Page: 190-195)
- An extension of the Ruzsa-Szemerédi theorem
Authors: Sárközy, GN; Selkow, SDate: 2005.Published by: COMBINATORICA (Volume no.: 25, Issue no.: 1, Page: 77-84)Download article: [pdf]
- On the size of partial block designs with large blocks
Authors: Sárközy, A; Sárközy, GNDate: 2005.Published by: DISCRETE MATHEMATICS (Volume no.: 305, Issue no.: 1-3, Page: 264-275)
- Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.
Authors: Sárközy, Gábor; Selkow, S.M.; Song, F.Date: 2011.Published by: Discrete Mathematics (Volume no.: 311, Page: 2079-2084.)
- Monochromatic cycle partitions of edge-colored graphs.
Authors: Sárközy, GáborDate: 2011.Published by: Journal of Graph Theory (Volume no.: 66, Issue no.: 1, Page: 57-64.)
- Long rainbow cycles in proper edge-colorings of complete graphs.
- Partitioning 3-colored complete graphs into three monochromatic cycles.
- The 3-colour Ramsey number of a 3-uniform Berge cycle.
Authors: Gyárfás, András; Sárközy, GáborDate: 2011.Published by: Combinatorics, Probability and Computing (Volume no.: 20, Issue no.: 1, Page: 53-71.)
- Long rainbow cycles in proper edge-colorings of complete graphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs.
Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, EndreDate: 2010.Published by: Annals of Combinatorics (Volume no.: 14, Issue no.: 2, Page: 245-249.)
- Ramsey-type results for Gallai colorings.
Authors: Gyárfás, András; Sárközy, Gábor; Sebő, András; Selkow, S.Date: 2010.Published by: Journal of Graph Theory (Volume no.: 64, Issue no.: 3, Page: 233-243.)
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs.
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
- How to avoid using the Regularity Lemma: Pósa's conjecture revisited.
Authors: Levitt, Ian; Sárközy, Gábor; Szemeredi, EndreDate: 2010.Published by: Discrete Mathematics (Volume no.: 310, Page: 630-641.)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.
Authors: Sárközy, GáborDate: 2009.Published by: Discrete Mathematics (Volume no.: 309, Page: 1611-1622.)
- Size of Monochromatic double stars in edge colorings
- Gallai colorings of non-complete graphs.
- Stability of the path-path Ramsey number.
- The Ramsey number of diamond matchings and loose cycles in hypergraphs.
Authors: Gyárfás, András; Sárközy, Gábor; Szemeredi , EndreDate: 2008.Published by: Electronic Journal of Combinatorics (Volume no.: 15, Page: #R126)
- Inequalities for the first-fit chromatic number.
Authors: Füredi, Zoltán; Gyárfás, András; Sárközy, Gábor; Selkow, StanleyDate: 2008.Published by: Journal of Graph Theory (Volume no.: 59, Page: 75-88.)
- Three-color Ramsey numbers for paths.
- Distributing vertices along a Hamiltonian cycle in Dirac graphs.
- Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
- Tripartite Ramsey numbers for paths.
- Three-color Ramsey numbers for paths.
- One-sided coverings of colored complete bipartite graphs
Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, EEditor: Klazar, MDate: 2006.Published by: Topics in discrete mathematics. Dedicated to Jarik Nešetril on the occasion of his 60th birthday. (Algorithms and combinatorics 26.) (Page: 133-154)
- An improved bound for the monochromatic cycle partition number
- On an anti-Ramsey problem of Burr, Erds, Graham, and T. Sós
New search
|
Search 
Magyar
