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

Showing 2015 · math.COShow all

4 papers · 2 filters

math.CO2015

A Combinatorial Problem Related to Sparse Systems of Equations

Peter Horak, Igor Semaev, Zsolt Tuza

Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, o…

math.CO2015★ 2 cited

$F$ -WORM colorings: Results for 2-connected graphs

Csilla Bujtás, Zsolt Tuza

Given two graphs $F$ and $G$ , an $F$ -WORM coloring of $G$ is an assignment of colors to its vertices in such a way that no $F$ -subgraph of $G$ is monochromatic or rainbow. If $G$ h…

math.CO2015

$K_{3}$ -WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum

Csilla Bujtás, Zsolt Tuza

A $K_{3}$ -WORM coloring of a graph $G$ is an assignment of colors to the vertices in such a way that the vertices of each $K_{3}$ -subgraph of $G$ get precisely two colors. We study gra…

math.CO2015

Transversal designs and induced decompositions of graphs

Csilla Bujtás, Zsolt Tuza

We prove that for every complete multipartite graph $F$ there exist very dense graphs $G_{n}$ on $n$ vertices, namely with as many as $(2 n) - c n$ edges for all $n$ , for some co…

A Combinatorial Problem Related to Sparse Systems of Equations

F-WORM colorings: Results for 2-connected graphs

K3​-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum

Transversal designs and induced decompositions of graphs

$F$ -WORM colorings: Results for 2-connected graphs

$K_{3}$ -WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum