4 citations · 8 across the 12 of their papers we have counts for
22 papers · 1 filter
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…
Localized versions of extremal problems
David Malec, Casey Tompkins
We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular w…
Subgraph densities in -free graphs
Andrzej Grzesik, Ervin Győri, Nika Salia +1
In this paper we disprove a conjecture of Lidický and Murphy about the number of copies of a given graph in a -free graph and give an alternative general conjecture. We also p…
Generalized Turán densities in the hypercube
Maria Axenovich, Laurin Benz, David Offner +1
A classical extremal, or Turán-type problem asks to determine , the largest number of edges in a subgraph of a graph which does not contain a subgraph isomorphi…
Counting cliques in -planar graphs
J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2
The problem of maximising the number of cliques among -vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…