2 citations · 3 across the 4 of their papers we have counts for
9 papers · 1 filter
Generalized Ramsey numbers of cycles, paths, and hypergraphs
Deepak Bal, Patrick Bennett, Emily Heath +1
Given a -uniform hypergraph and a set of -uniform hypergraphs , the generalized Ramsey number is the minimum number of colors needed to…
Edge-coloring a graph so that every copy of a graph has an odd color class
Patrick Bennett, Emily Heath, Shira Zerbib
Recently, Alon introduced the notion of an -code for a graph : a collection of graphs on vertex set is an -code if it contains no two members whose symmetric differe…
New bounds on the generalized Ramsey number
Enrique Gomez-Leos, Emily Heath, Alex Parker +2
Let denote the minimum number of colors needed to color the edges of so that every copy of receives at least distinct colors. In this note, we show $\fra…
The maximum number of odd cycles in a planar graph
Emily Heath, Ryan R. Martin, Chris Wells
How many copies of a fixed odd cycle, , can a planar graph contain? We answer this question asymptotically for and prove a bound which is tight up to a fa…
Embedded graph 3-coloring and flows
Caroline Bang, Zdeněk Dvořák, Emily Heath +1
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between color…
Generalized rainbow Turán numbers of odd cycles
József Balogh, Michelle Delcourt, Emily Heath +1
Given graphs and , the generalized rainbow Turán number is the maximum number of copies of in an -vertex graph with a proper edge-co…