Kitti Varga

activity

20162025

t

-tough graphs

16 citations · 30 across the 19 of their papers we have counts for

collaborators

Showing 2022Show all

7 papers · 1 filter

math.CO2022★ 1 cited

Edges not covered by monochromatic bipartite graphs

Xiutao Zhu, Ervin Győri, Zhen He +4

Let $f_{k} (n, H)$ denote the maximum number of edges not contained in any monochromatic copy of~ $H$ in a $k$ -coloring of the edges of $K_{n}$ , and let $e x (n, H)$ denote the Turán number…

math.CO2022

Generalized Turan number for the edge blow-up graph

Zequn Lv, Ervin Győri, Zhen He +4

Let $H$ be a graph and $p$ be an integer. The edge blow-up $H^{p}$ of $H$ is the graph obtained from replacing each edge in $H$ by a copy of $K_{p}$ where the new vertices of the cliqu…

math.CO2022

On minimally tough chordal graphs

Clément Dallard, Blas Fernández, Gyula Y. Katona +2

Katona and Varga showed that for any rational number $t \in (1/2, 1]$ , no chordal graph is minimally $t$ -tough, while Katona and Khan characterized all minimally $t$ -tough, chordal…

math.CO2022

Exact results for generalized extremal problems forbidding an even cycle

Ervin Győri, Zhen He, Zequn Lv +4

We determine the maximum number of copies of $K_{s, s}$ in a $C_{2 s + 2}$ -free $n$ -vertex graph for all integers $s \geq 2$ and sufficiently large $n$ . Moreover, for $s \in {2, 3}$ and…

math.PR2022★ 1 cited

Color-avoiding percolation in edge-colored Erdős-Rényi graphs

Balázs Ráth, Kitti Varga, Panna Tímea Fekete +1

We study a variant of the color-avoiding percolation model introduced by Krause et al., namely we investigate the color-avoiding bond percolation setup on (not necessarily properly…

math.CO2022★ 2 cited

Extremal results for graphs avoiding a rainbow subgraph

Peter Frankl, Ervin Győri, Zhen He +5

We say that $k$ graphs $G_{1}, G_{2}, \dots, G_{k}$ on a common vertex set of size $n$ contain a rainbow copy of a graph $H$ if their union contains a copy of $H$ with each edge belonging t…

math.OC2022

Inverse optimization problems with multiple weight functions

Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga

We introduce a new class of inverse optimization problems in which an input solution is given together with $k$ linear weight functions, and the goal is to modify the weights by th…