1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2025★ 1 cited
Burling graphs in graphs with large chromatic number
Tara Abrishami, Marcin Briański, James Davies +4
A graph class is -bounded if the only way to force large chromatic number in graphs from the class is by forming a large clique. In the 1970s, Erdős conjectured that intersectio…
math.CO2024
On high genus extensions of Negami's conjecture
Marcin Briański, James Davies, Jane Tan
Negami's famous planar cover conjecture is equivalent to the statement that a connected graph can be embedded in the projective plane if and only if it has a projective planar cove…