Abstract
AbstractWe prove that for every digraph and every assignment of pairs of integers to its arcs there exists an integer such that every digraph with dichromatic number greater than contains a subdivision of in which is subdivided into a directed path of length congruent to modulo , for every . This generalizes to the directed setting the analogous result by Thomassen for undirected graphs, and at the same time yields a novel short proof of his result.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
