4 papers · 1 filter
Choosability of multipartite hypergraphs
Peter Bradshaw, Abhishek Dhawan, Nhi Dinh +2
A -uniform hypergraph (or -graph) is -partite if can be partitioned into sets such that each edge in contains precisely one ver…
Density of rainbow triangles and properly colored 's
József Balogh, Peter Bradshaw, Ramon I. Garcia +1
We establish a sharp upper bound on the number of properly -edge-colored 's in graphs with red, green and blue edges. We give a computer-free flag-algebra proof…
Flexible DP 3-coloring of sparse multigraphs
Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka
A \emph{request} on a graph assigns a preferred color to a subset of the vertices. A graph is \emph{-flexibly -choosable} if for every -list assignment and every r…
Toward Vu's conjecture
Peter Bradshaw, Abhishek Dhawan, Abhishek Methuku +1
In 2002, Vu conjectured that graphs of maximum degree and maximum codegree at most have chromatic number at most . Despite its importance, the conjecture has re…