Abstract
AbstractHajnal and Erdős proved that a graph with uncountable chromatic number cannot avoid short cycles, it must contain, for example, (among other obligatory subgraphs). It was shown recently by Soukup that, in contrast of the undirected case, it is consistent that for any there exists an uncountably dichromatic digraph without directed cycles shorter than . He asked if it is provable already in ZFC (i.e., Zermelo ‐Fraenkel set theory with the Axiom of choice). We answer his question positively by constructing for every infinite cardinal and a digraph of size with dichromatic number at least without directed cycles of length less than .
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
