1 citations · 1 across the 3 of their papers we have counts for
5 papers
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…
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…