39 citations · 111 across the 33 of their papers we have counts for
42 papers · 1 filter
The maximum Wiener index of a uniform hypergraph
Stijn Cambie, Ervin Győri, Nika Salia +2
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected -vertex…
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…
Rainbow saturation for complete graphs
Debsoumya Chakraborti, Kevin Hendrey, Ben Lund +1
We call an edge-colored graph rainbow if all of its edges receive distinct colors. An edge-colored graph is called -rainbow saturated if does not contain a rainbow copy…
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…
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…
The maximum number of copies of an even cycle in a planar graph
Zequn Lv, Ervin Győri, Zhen He +3
We resolve a conjecture of Cox and Martin by determining asymptotically for every the maximum number of copies of in an -vertex planar graph.
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…
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…
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…
Maximal -wise intersecting families
József Balogh, Ce Chen, Kevin Hendrey +4
A family on ground set is maximal -wise intersecting if every collection of at most sets in has non-empty intersection,…
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…
Ramsey numbers of Boolean lattices
Dániel Grósz, Abhishek Methuku, Casey Tompkins
The poset Ramsey number is the smallest integer such that any blue-red coloring of the elements of the Boolean lattice has a blue induced copy of or a…
On -uniform hypergraphs avoiding a cycle of length four
Beka Ergemlidze, Ervin Győri, Abhishek Methuku +2
In this note we show that the maximum number of edges in a -uniform hypergraph without a Berge cycle of length four is at most . This improves…
Inverse Turán numbers
Ervin Győri, Nika Salia, Casey Tompkins +1
For given graphs and , the Turán number is defined to be the maximum number of edges in an -free subgraph of . Foucaud, Krivelevich and Perarnau and later in…
Saturation problems in the Ramsey theory of graphs, posets and point sets
Gábor Damásdi, Balázs Keszegh, David Malec +3
In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in…
Generalized Planar Turán Numbers
Ervin Győri, Addisu Paulos, Nika Salia +2
In a generalized Turán problem, we are given graphs and and seek to maximize the number of copies of in an -free graph of order . We consider generalized Turán pr…
Independent Chains in Acyclic Posets
Nika Salia, Christoph Spiegel, Casey Tompkins +1
We consider the problem of determining the maximum order of an induced vertex-disjoint union of cliques in a graph. More specifically, given some family of graphs of…
Set systems related to a house allocation problem
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku +4
We are given a set of buyers, a set of houses, and for each buyer a preference list, i.e., an ordering of the houses. A house allocation is an injective mapping from $A…
The Maximum Number of Paths of Length Three in a Planar Graph
Andrzej Grzesik, Ervin Győri, Addisu Paulos +3
Let denote the maximum number of copies of possible in an -vertex planar graph. The function has been determined when is a cycle of length or b…
The Maximum Number of Pentagons in a Planar Graph
Ervin Győri, Addisu Paulos, Nika Salia +2
In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an -vertex planar graph. They precisely determined the maximum numb…
Long path and cycle decompositions of even hypercubes
Maria Axenovich, David Offner, Casey Tompkins
We consider edge decompositions of the -dimensional hypercube into isomorphic copies of a given graph . While a number of results are known about decomposing into…
On forbidden poset problems in the linear lattice
Jimeng Xiao, Casey Tompkins
In this note, we determine the maximum size of a -free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as…