Randomized trial shows the presence of cycle subdivisions in chromatic digraphs spanned by Hamiltonian paths, suggesting deeper structural insights.
Let C be any oriented cycle on n vertices. We show that every (10n−4)-chromatic digraph spanned by a Hamiltonian directed path contains a subdivision of C.
No takes yet. Share an insight, caveat, or question.
Ghazal et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: