University of Pannonia

output

19982026

most citedA fractionally ionic approach to polarizability and van der Waals many-body dispersion calculations

128 citations

Showing math.COShow all

31 papers · 1 filter

math.CO2024

An exploration of the balance game

Paul Dorbec, Michael A. Henning, Zsolt Tuza +1

The balance game is played on a graph $G$ by two players, Admirable (A) and Impish (I), who take turns selecting unlabeled vertices of $G$ . Admirable labels the selected vertices b…

math.CO2024★ 1 cited

Monochromatic graph decompositions inspired by anti-Ramsey theory and the odd-coloring problem

Yair Caro, Zsolt Tuza

We consider extremal edge-coloring problems inspired by the theory of anti-Ramsey / rainbow coloring, and further by odd-colorings and conflict-free colorings. Let $G$ be a graph,…

math.CO2022★ 3 cited

Monochromatic spanning trees and matchings in ordered complete graphs

János Barát, András Gyárfás, Géza Tóth

Two independent edges in ordered graphs can be nested, crossing or separated. These relations define six types of subgraphs, depending on which relations are forbidden. We refine a…

math.CO2021

Saturated $2$ -planar drawings with few edges

János Barát, Géza Tóth

A drawing of a graph is $k$ -plane if every edge contains at most $k$ crossings. A $k$ -plane drawing is saturated if we cannot add any edge so that the drawing remains $k$ -plane. It…

math.CO2021

The k-path vertex cover: general bounds and chordal graphs

Csilla Bujtás, Marko Jakovac, Zsolt Tuza

For an integer $k \geq 3$ , a $k$ -path vertex cover of a graph $G = (V, E)$ is a set $T \subseteq V$ that shares a vertex with every path subgraph of order $k$ in $G$ . The minimum cardina…

math.CO2020

Intersecting and $2$ -intersecting hypergraphs with maximal covering number: the Erdős-Lovász theme revisited

János Barát

Erdős and Lovász noticed that an $r$ -uniform intersecting hypergraph $H$ with maximal covering number, that is $τ (H) = r$ , must have at least $\frac{8}{3} r - 3$ edges. There has been n…