Related papers: Combinatorial modifications of Reeb graphs and the…

We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph…

Let $M$ be a closed surface. By $\Homeo(M)$ we denote the group of orientation preserving homeomorphisms of $M$ and let $\MC(M)$ denote the Mapping class group. In this paper we complete the proof of the conjecture of Thurston that says…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

The Reeb graph of a smooth function is a graph being a natural quotient space of the manifold of the domain and the space of all connected components of preimages. Such a combinatorial and topological object roughly and compactly represents…

Let $M$ be a connected compact contact toric manifold. Most of such manifolds are of Reeb type. We show that if $M$ is of Reeb type, then $\pi_1(M)$ is finite cyclic, and we describe how to obtain the order of $\pi_1(M)$ from the moment map…

Let $M$ be a smooth compact surface, orientable or not, with boundary or without it, $P$ either the real line $R^1$ or the circle $S^1$, and $Diff(M)$ the group of diffeomorphisms of $M$ acting on $C^{\infty}(M,P)$ by the rule $h\cdot…

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…

For a definable continuous mapping $f$ from a definable connected open subset $\Omega$ of $\mathbb R^n$ into $\mathbb R^n,$ we show that the following statements are equivalent: (i) The mapping $f$ is open. (ii) The fibers of $f$ are finite…

Let M be a closed manifold whose based loop space is ``complicated''. Examples are rationally hyperbolic manifolds and manifolds whose fundamental group has exponential growth. We prove that the topological entropy of any Reeb flow on the…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

We investigate properties of a multivariate function $E(m_1,m_2,...,m_r)$, called {\it orbicyclic}, that arises in enumerative combinatorics in counting non-isomorphic maps on orientable surfaces. $E(m_1,m_2,...,m_r)$ proves to be…

This article consists in applications of [arXiv:2511.14232] in the case of homemomorphisms of higher genus surfaces whose homological rotation set is big enough -- a class of dynamics that is open. We first prove a structure theorem for the…

We prove a Reeb sphere theorem for finite simple graphs. The result bridges two different definitions of spheres in graph theory. We also reformulate Morse conditions in terms of the center manifolds, the level surface graphs {f=f(x)} in…

Let $M$ be a connected compact orientable surface, $f:M\to \mathbb{R}$ be a Morse function, and $h:M\to M$ be a diffeomorphism which preserves $f$ in the sense that $f\circ h = f$. We will show that if $h$ leaves invariant each regular…

For a given finite class of finite graphs H, a graph G is called a realization of H if the neighbourhood of its any vertex induces the subgraph isomorphic to a graph of H. We consider the following problem known as the Generalized…

We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $\mathbb{X}$ equipped with a continuous function $f: \mathbb{X} \rightarrow \mathbb{R}$. We first give a categorification of the…

A graph G is locally isometric if the subgraph induced by the neighbourhood of every vertex is an isometric subgraph of G. It is shown that the hamilton cycle problem for locally isometric graphs with maximum degree at most 8 is…