G. Sárközy

collaborators

4 papers

math.CO2025

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s

AndrÃ¡s GyÃ¡rfÃ¡s, Ryan R. Martin, MiklÃ³s RuszinkÃ³ +1

We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_{B} (G)$ denote the smallest number of colors needed f…

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.CO2024

Clique covers of complete graphs and piercing multitrack intervals

JÃ¡nos BarÃ¡t, AndrÃ¡s GyÃ¡rfÃ¡s, GÃ¡bor N. SÃ¡rkÃ¶zy

Assume that $R_{1}, R_{2}, \dots, R_{t}$ are disjoint parallel lines in the plane. A $t$ -interval (or $t$ -track interval) is a set that can be written as the union of $t$ closed intervals,…

cs.DS2024

Improved Lower Bounds on the Expected Length of Longest Common Subsequences

George T. Heineman, Chase Miller, Daniel Reichman +3

It has been proven that, when normalized by $n$ , the expected length of a longest common subsequence of $d$ random strings of length $n$ over an alphabet of size $I ¨ $ converges to…

Proper edge colorings of planar graphs with rainbow C4​-s

2-reachable subsets in two-colored graphs

Clique covers of complete graphs and piercing multitrack intervals

Improved Lower Bounds on the Expected Length of Longest Common Subsequences

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s