András Gyárfás

collaborators

3 papers

math.CO2026

Bounded diameter covering of 2-colored complete bipartite graphs

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

Related to a bounded-diameter bipartite analogue of the Henderson--Ryser conjecture, DeBiasio, Kamel, McCourt, and Sheats proved that the vertices of every $2$ -colored complete bip…

math.CO2025

2-reachable subsets in two-colored graphs

Andras Gyarfas, Gabor N. Sarkozy

A subset $X$ of vertices in a graph $G$ is a {\em diameter 2 subset} if the distance of any two vertices of $X$ is at most two {\em in $G [X]$ }. Relaxing this notion, a subset $X$ o…

math.CO2025

Bounded diameter variations of Ryser's conjecture

Andras Gyarfas, Gabor N. Sarkozy

In this paper we study bounded diameter variations of the following form of Ryser's conjecture. For every graph $G = (V, E)$ with independence number $α (G) = α$ and integer $r \geq 2$ , i…