39 citations · 111 across the 33 of their papers we have counts for
6 papers · 1 filter
An Erdős-Gallai type theorem for vertex colored graphs
Nika Salia, Casey Tompkins, Oscar Zamora
While investigating odd-cycle free hypergraphs, Győri and Lemons introduced a colored version of the classical theorem of Erdős and Gallai on -free graphs. They proved that an…
On Edge-Colored Saturation Problems
Michael Ferrara, Daniel Johnston, Sarah Loeb +6
Let be a family of edge-colored graphs. A -edge colored graph is -saturated if does not contain any graph in but the additi…
On an extremal problem involving a pair of forbidden posets
Casey Tompkins, Yao Wang
Resolving a conjecture of Methuku and the first author we determine the size of the largest family of subsets of an -element set avoiding both and as induced subpos…
On the maximum size of connected hypergraphs without a path of given length
Ervin Győri, Abhishek Methuku, Nika Salia +2
In this note we asymptotically determine the maximum number of hyperedges possible in an -uniform, connected -vertex hypergraph without a Berge path of length , as and…
On the Turán number of some ordered even cycles
Ervin Győri, Dániel Korándi, Abhishek Methuku +3
A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on vertices contains no cycle of length then it has at most edges…
On subgraphs of -free graphs and a problem of Kühn and Osthus
Dániel Grósz, Abhishek Methuku, Casey Tompkins
Let denote the largest constant such that every -free graph contains a bipartite and -free subgraph having fraction of edges of . Győri et al. showed tha…