G. Sárközy

activity

19962019

most citedPartitioning 2-edge-colored graphs by monochromatic paths and cycles

35 citations · 56 across the 9 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015

Cliques in C_4-free graphs of large minimum degree

A. Gyarfas, G. N. Sarkozy

A graph $G$ is called $C_{4}$ -free if it does not contain the cycle $C_{4}$ as an induced subgraph. Hubenko, Solymosi and the first author proved (answering a question of Erd\H os) a p…

math.CO2015★ 35 cited

Partitioning 2-edge-colored graphs by monochromatic paths and cycles

Jozsef Balogh, Janos Barat, Daniel Gerbner +2

We present results on partitioning the vertices of $2$ -edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárköz…

math.CO2015★ 3 cited

Ramsey number of a connected triangle matching

Andras Gyarfas, Gabor N. Sarkozy

We determine the $2$ -color Ramsey number of a {\em connected} triangle matching $c (n K_{3})$ which is any connected graph containing $n$ vertex disjoint triangles. We obtain that $R(c…

math.CO2015★ 4 cited

Rainbow matchings in bipartite multigraphs

János Barát, András Gyárfás, Gábor N. Sárközy

Suppose that $k$ is a non-negative integer and a bipartite multigraph $G$ is the union of $N = ⌊ \frac{k + 2}{k + 1} n ⌋ - (k + 1)$ matchings $M_{1}, \dots, M_{N}$ , each of…