Z. Tuza

activity

20042026

most citedComputing all possible graph structures describing linearly conjugate realizations of kinetic systems

16 citations · 50 across the 58 of their papers we have counts for

collaborators

70 papers

math.CO2026

The strong (non-induced) Turán numbers

Yair Caro, Zsolt Tuza

In this paper we introduce and explore the following new graph invariant: For a graph $G$ on $k$ vertices, $G \neq = K_{k}$ , let $s t (n, G)$ denote the maximum number of edges in a graph…

math.CO2026

Induced/Incomparable versus Ramsey

Yair Caro, Zsolt Tuza, Christina Zarb

We consider the following problem: Let $H$ and $F$ be two graphs on $k$ vertices and assume $F \neq = H$ . We say that $H$ and $F$ are incomparable if neither $F$ nor $H$ contains the…

math.MG2026

Covering a square by congruent squares

György Dósa, Zsolt Lángi, Zsolt Tuza

The main goal of this paper is to address the following problem: given a positive integer $n$ , find the largest value $S (n)$ such that a square of edge length $S (n)$ in the Euclide…

math.CO2025

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs

Yair Caro, Mirko Petruševski, Riste Škrekovski +1

An odd independent set $S$ in a graph $G = (V, E)$ is an independent set of vertices such that, for every vertex $v \in V ∖ S$ , either $N (v) \cap S = \emptyset$ or $|N(v) \cap…

math.CO2025

The odd independence number of graphs, I: Foundations and classical classes

Yair Caro, Mirko Petruševski, Riste Škrekovski +1

An odd independent set $S$ in a graph $G = (V, E)$ is an independent set of vertices such that, for every vertex $v \in V ∖ S$ , either $N (v) \cap S = \emptyset$ or $|N(v) \cap…

math.CO2025

Nordhaus-Gaddum-type theorems for maximum average degree

Yair Caro, Zsolt Tuza

A $k$ -decomposition $(G_{1}, \dots, G_{k})$ of a graph $G$ is a partition of its edge set into $k$ spanning subgraphs $G_{1}, \dots, G_{k}$ . The classical theorem of Nordhaus and Gaddum bounds…