Gábor N. Sárközy

collaborators

4 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.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,…

math.CO2024

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…

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 $σ$ converges to s…

Bounded diameter covering of 2-colored complete bipartite graphs

Clique covers of complete graphs and piercing multitrack intervals

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

Improved Lower Bounds on the Expected Length of Longest Common Subsequences

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