Items where Author is "Sárközy, Gábor"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | No Grouping
Number of items: 31.
DateAuthor/TitleDocument Type
2011Gyárfás, András and Sárközy, Gábor
The 3-colour Ramsey number of a 3-uniform Berge cycle
ISI Article
2011Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Schelp, R
Long rainbow cycles in proper edge-colorings of complete graphs
Article
2011Sárközy, Gábor
Monochromatic cycle partitions of edge-colored graphs
ISI Article
2011Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre
Partitioning 3-colored complete graphs into three monochromatic cycles
ISI Article
2011Sárközy, Gábor and Selkow, S and Song, F
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs
ISI Article
2010Gyárfás, András and Sárközy, Gábor
Gallai colorings of non-complete graphs
ISI Article
2010Levitt, Ian and Sárközy, Gábor and Szemeredi, Endre
How to avoid using the Regularity Lemma: Pósa's conjecture revisited
ISI Article
2010Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre
Long monochromatic Berge cycles in colored 4-uniform hypergraphs
ISI Article
2010Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
ISI Article
2010Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre
Monochromatic matchings in the shadow graph of almost complete hypergraphs
ISI Article
2010Gyárfás, András and Sárközy, Gábor and Sebő, András and Selkow, S.
Ramsey-type results for Gallai colorings
ISI Article
2009Gyárfás, András and Sárközy, Gábor and Schelp, Richard
Multipartite Ramsey numbers for odd cycles
ISI Article
2009Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre
Stability of the path-path Ramsey number
ISI Article
2009Sárközy, Gábor
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
ISI Article
2008Sárközy, Gábor and Selkow, Stanley
Distributing vertices along a Hamiltonian cycle in Dirac graphs
ISI Article
2008Füredi, Zoltán and Gyárfás, András and Sárközy, Gábor and Selkow, Stanley
Inequalities for the first-fit chromatic number
ISI Article
2008Gyárfás, András and Lehel, Jenő and Sárközy, Gábor and Schelp, Richard
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
ISI Article
2008Dorbec, Paul and Gravier, Sylvain and Sárközy, Gábor
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs
ISI Article
2008Sárközy, Gábor
On 2-factors with k components
ISI Article
2008Gyárfás, András and Sárközy, Gábor and Szemeredi, Endre
The Ramsey number of diamond matchings and loose cycles in hypergraphs
ISI Article
2008Gyárfás, András and Sárközy, Gábor
Size of Monochromatic double stars in edge colorings
Article
2008Gyárfás, András and Sárközy, Gábor
Size of monochromatic components in local edge colorings
ISI Article
2008Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre
Three-color Ramsey numbers for paths
ISI Article
2007Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre
Three-color Ramsey numbers for paths
ISI Article
2007Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre
Tripartite Ramsey numbers for paths
ISI Article
2006Sárközy, Gábor and Selkow, S.
On an anti-Ramsey problem of Burr, Erds, Graham, and T. Sós
ISI Article
2006Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemeredi, E.
One-sided coverings of colored complete bipartite graphs
Book Section
2006Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemeredi, E.
An improved bound for the monochromatic cycle partition number
ISI Article
2005Sárközy, Gábor and Seklow, S.
On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
Article
2005Sárközy, A. and Sárközy, Gábor
On the size of partial block designs with large blocks
Article
2005Sárközy, Gábor and Selkow, S.
An extension of the Ruzsa-Szemerédi theorem
Article
This list was generated on Sat Dec 7 03:17:35 2024 CET.