most citedEdge-coloring a graph so that every copy of a graph has an odd color class

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023

Asymmetric Ramsey properties of randomly perturbed graphs

Emily Heath, Daniel McGinnis

In this note, we investigate for various pairs of graphs the question of how many random edges must be added to a dense graph to guarantee that any red-blue coloring of the…

math.CO2023★ 2 cited

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…

math.CO2023

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…