arXiv · 1811.08031
Combinatorial modifications of Reeb graphs and the realization problem
Abstract
We prove that, up to homeomorphism, any graph subject to natural necessary conditions on orientation and the cycle rank can be realized as the Reeb graph of a Morse function on a given closed manifold $M$. Along the way, we show that the Reeb number $\mathcal{R}(M)$, i.e. the maximum cycle rank among all Reeb graphs of functions on $M$, is equal to the corank of fundamental group $\pi_1(M)$, thus extending a previous result of Gelbukh to the non-orientable case.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Łukasz Patryk Michalak. 2018-11-20. Combinatorial modifications of Reeb graphs and the realization problem. https://doi.org/10.1007/s00454-020-00260-6
Cite the original work for its findings. Save a collection to share your selection of sources.