Béla Csaba

activity

20242026

collaborators

4 papers

math.CO2026

A stability theorem for embedding bounded degree spanning trees

BÃ©la Csaba

We prove that if an $n$ -vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T \subset G$ even when the minimum degree of $G$ is less than $n /2$ …

math.CO2026

Decomposition of degree-regular graphs into quasi-random pairs without the Regularity lemma

BÃ©la Csaba

The SzemerÃ©di Regularity Lemma, in combination with the Blow-up Lemma, form the Regularity Method, a fundamental tool in graph embeddings, albeit restricted to very large and dens…

math.CO2025

On the Ramsey-TurÃ¡n problem for 4-cliques

BÃ©la Csaba

We present an essentially tight bound for the Ramsey-TurÃ¡n problem for 4-cliques without using the Regularity lemma. This enables us to substantially extend the range in which one…

cs.DS2024

On the Advice Complexity of Online Matching on the Line

We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n - 1,$ and show that there is no 1-competitive…