Kitti Varga

activity

20182025

most citedEdges not covered by monochromatic bipartite graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025

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 $[n]$ avoiding a solution to the equation $x + y = z$ is of size $⌈ n /2 ⌉$ . For all intege…

math.CO2023

On graphs without cycles of length 0 modulo 4

Ervin Győri, Binlong Li, Nika Salia +3

Bollobás proved that for every $k$ and $ℓ$ such that $k Z + ℓ$ contains an even number, an $n$ -vertex graph containing no cycle of length $ℓ mod k$ can contain at…

math.CO2023

A new construction for planar Turán number of cycle

Ervin Győri, Kitti Varga, Xiutao Zhu

The planar Turán number $ex_{P} (n, C_{k})$ is the largest number of edges in an $n$ -vertex planar graph with no cycle of length $k$ . Let $k \geq 11$ and $C, D$ be constan…

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…