1 citations · 1 across the 4 of their papers we have counts for
4 papers
Odd Ramsey numbers of multipartite graphs and hypergraphs
Nicholas Crawford, Emily Heath, Owen Henderschedt +2
Given a hypergraph and a subhypergraph of , the \emph{odd Ramsey number} is the minimum number of colors needed to edge-color so that every copy of $H…
Rainbow Erdős-Sós Conjectures
Nicholas Crawford, Dylan King, Sam Spiro
An edge colored graph is said to contain rainbow- if is a subgraph and every edge receives a different color. In 2007, Keevash, Mubayi, Sudakov, and Verstraëte introduced th…
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
James Anderson, Herman Chau, Eun-Kyung Cho +6
We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chr…
On the interval coloring impropriety of graphs
MacKenzie Carr, Eun-Kyung Cho, Nicholas Crawford +3
An improper interval (edge) coloring of a graph is an assignment of colors to the edges of satisfying the condition that, for every vertex , the set of colors a…