Totally Odd -subdivisions in 4-chromatic Graphs

We prove the conjecture made by Bjarne Toft in 1975 that every 4-chromatic graph contains a subdivision of in which each edge of corresponds to a path of odd length. As an auxiliary result we characterize completely the subspace of the cycle space generated by all cycles through two fixed edges. Toft's conjecture was proved independently in 1995 by Wenan Zang.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received May 26, 1998

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Thomassen, C. Totally Odd -subdivisions in 4-chromatic Graphs. Combinatorica 21, 417–443 (2001). https://doi.org/10.1007/s004930100006

Download citation

  • AMS Subject Classification (2000) Classes:  05C15