MathDBLovász's conjecture on even directed cycles
Lovász's conjecture on even directed cycles
A digraph is -strongly connected when its strong connectivity is at least . Lovász's conjecture. There exists an integer such that every -strongly connected digraph has an even directed cycle. The source presents this as a consequence of Thomassen's conjecture and does not state a resolution.
Sources & referencesView supporting material
Primary source
Pierre Aboulker, Nathann Cohen, Fréderic Havet, William Lochet, Phablo F. S. Moura and Stéphan Thomassé, “Subdivisions in digraphs of large out-degree or large dichromatic number”, arXiv:1610.00876 (2016).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.