16 citations · 30 across the 19 of their papers we have counts for
20 papers
Sets avoiding a rainbow solution to the generalized Schur equation
Ervin Győri, Zhen He, Zequn Lv +4
A classical result in combinatorial number theory states that the largest subset of avoiding a solution to the equation is of size . For all intege…
On graphs without cycles of length 0 modulo 4
Ervin Győri, Binlong Li, Nika Salia +3
Bollobás proved that for every and such that contains an even number, an -vertex graph containing no cycle of length can contain at…
A new construction for planar Turán number of cycle
Ervin Győri, Kitti Varga, Xiutao Zhu
The planar Turán number is the largest number of edges in an -vertex planar graph with no cycle of length . Let and be constan…
Newton-type algorithms for inverse optimization II: weighted span objective
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
In inverse optimization problems, the goal is to modify the costs in an underlying optimization problem in such a way that a given solution becomes optimal, while the difference be…
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and -norm objectives
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
In minimum-cost inverse optimization problems, we are given a feasible solution to an underlying optimization problem together with a linear cost function, and the goal is to modif…
Color-avoiding connected spanning subgraphs with minimum number of edges
József Pintér, Kitti Varga
We call a (not necessarily properly) edge-colored graph edge-color-avoiding connected if after the removal of edges of any single color, the graph remains connected. For vertex-col…
On the rainbow planar Turán number of paths
Ervin Győri, Ryan R. Martin, Addisu Paulos +2
An edge-colored graph is said to contain a rainbow- if it contains as a subgraph and every edge of is a distinct color. The problem of maximizing edges among -vertex…
Edges not covered by monochromatic bipartite graphs
Xiutao Zhu, Ervin Győri, Zhen He +4
Let denote the maximum number of edges not contained in any monochromatic copy of~ in a -coloring of the edges of , and let denote the Turán number…
Generalized Turan number for the edge blow-up graph
Zequn Lv, Ervin Győri, Zhen He +4
Let be a graph and be an integer. The edge blow-up of is the graph obtained from replacing each edge in by a copy of where the new vertices of the cliqu…
On minimally tough chordal graphs
Clément Dallard, Blas Fernández, Gyula Y. Katona +2
Katona and Varga showed that for any rational number , no chordal graph is minimally -tough, while Katona and Khan characterized all minimally -tough, chordal…
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 in a -free -vertex graph for all integers and sufficiently large . Moreover, for and…
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…
Extremal results for graphs avoiding a rainbow subgraph
Peter Frankl, Ervin Győri, Zhen He +5
We say that graphs on a common vertex set of size contain a rainbow copy of a graph if their union contains a copy of with each edge belonging t…
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 linear weight functions, and the goal is to modify the weights by th…
Strengthening some complexity results on toughness of graphs
Gyula Y Katona, Kitti Varga
Let be a positive real number. A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components. The toughness of a…
On the complexity of color-avoiding site and bond percolation
Roland Molontay, Kitti Varga
The mathematical analysis of robustness and error-tolerance of complex networks has been in the center of research interest. On the other hand, little work has been done when the a…
Decomposition of a graph into two disjoint odd subgraphs
Mikio Kano, Gyula Y. Katona, Kitti Varga
An odd (resp. even) subgraph in a multigraph is its subgraph in which every vertex has odd (resp. even) degree. We say that a multigraph can be decomposed into two odd subgraphs if…
Minimal toughness in special graph classes
Gyula Y. Katona, Kitti Varga
Let be a positive real number. A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components, and all graphs are…
The complexity of recognizing minimally tough graphs
Gyula Y Katona, István Kovács, Kitti Varga
A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components. The toughness of a graph is the largest for which…
Properties of minimally -tough graphs
Gyula Y. Katona, Dániel Soltész, Kitti Varga
A graph is minimally -tough if the toughness of is and the deletion of any edge from decreases the toughness. Kriesell conjectured that for every minimally -t…