A. Gyárfás

activity

20102024

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

35 citations · 136 across the 22 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Ramsey numbers of path-matchings, covering designs and 1-cores

Louis DeBiasio, András Gyárfás, Gábor N. Sárközy

A path-matching of order $p$ is a vertex disjoint union of nontrivial paths spanning $p$ vertices. Burr and Roberts, and Faudree and Schelp determined the 2-color Ramsey number of…

math.CO2019

Order plus size of $τ$ -critical graphs

Andras Gyarfas, Lehel Jeno

Let $G = (V, E)$ be a $τ$ -critical graph with $τ (G) = t$ . Erdős and Gallai proved that $∣ V ∣ \leq 2 t$ and the bound $∣ E ∣ \leq (2 t + 1)$ was obtained by Erdős, Hajnal and Moon. We giv…

math.CO2019★ 7 cited

Distribution of colors in Gallai colorings

András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós +1

A Gallai coloring is an edge coloring that avoids triangles colored with three different colors. Given integers $e_{1} \geq e_{2} \geq \dots \geq e_{k}$ with $\sum_{i = 1}^{k} e_{i} = (2 n)$ …

Ramsey numbers of path-matchings, covering designs and 1-cores

Order plus size of τ-critical graphs

Distribution of colors in Gallai colorings

Order plus size of $τ$ -critical graphs