Tibor Szab'o

collaborators

5 papers

math.CO2025

The maximum diameter of 2-dimensional simplicial complexes

Olaf Parczyk, Silas Rathke, Tibor Szabó

We study a problem of Santos about the largest possible diameter of a $d$ -dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value o…

math.CO2025

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs

Yamaan Attwa, Sam Mattheus, Tibor Szabó +1

We provide two novel constructions of $r$ edge-disjoint $K_{k + 1}$ -free graphs on the same vertex set, each of which has the property that every small induced subgraph contains a co…

math.CO2025

Slow graph bootstrap percolation III: Chain constructions

David Fabian, Patrick Morris, Tibor Szabó

For graphs $H$ , we study the extremal function $M_{H} (n)$ which is the maximum running time (until stabilisation) of an $H$ -bootstrap percolation process on $n$ vertices. Building on…

math.CO2025

Almost-perfect colorful matchings in three-edge-colored bipartite graphs

Simona Boyadzhiyska, Micha Christoph, Tibor Szabó

We prove that, for positive integers $n, a_{1}, a_{2}, a_{3}$ satisfying $a_{1} + a_{2} + a_{3} = n - 1$ , it holds that any bipartite graph $G$ which is the union of three perfect matchings $M_{1}$ , $M…

math.CO2025

On almost Gallai colourings in complete graphs

Alexandr Grebennikov, Letícia Mattos, Tibor Szabó

For $t \in N$ , we say that a colouring of $E (K_{n})$ is $almost$ $t$ - $Gallai$ if no two rainbow $t$ -cliques share an edge. Motivated by a lemma of Berkowit…