16 citations · 30 across the 19 of their papers we have counts for
6 papers · 1 filter
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…