Related papers: Topological rigidity of higher graph manifolds

The Torelli group of a manifold is the group of all diffeomorphisms which act as the identity on the homology of the manifold. In this paper, we calculate the invariant part (invariant under the action of the automorphisms of the homology)…

We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…

We prove special cases of a general conjecture: If an invertible field theory admits a projectively topological boundary theory, then it has finite order in the abelian group of invertible field theories. One can substitute `gapped' for…

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…

We show that if $Y$ is a toroidal closed graph manifold rational homology $3$-sphere with $|H_1(Y;\mathbb{Z})| \le 5$, then there exists an irreducible representation $\fund{Y} \to SU(2)$, using topological methods and avoiding the use of…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

We give a new proof of the theorem of Birman-Powell that the Torelli subgroup of the mapping class group of a closed orientable surface of genus at least 3 is generated by simple homeomorphisms known as bounding pair maps. The key…

We prove some restriction theorems for flat homogeneous surfaces of codimension greater than one.

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

We show that there is an hierarchy of intersection rigidity properties of sets in a closed symplectic manifold: some sets cannot be displaced by symplectomorphisms from more sets than the others. We also find new examples of rigidity of…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

We show, up to h-cobordism, that the existence and uniqueness of connected sum decompositions of oriented 4-dimensional manifolds is an invariant of homotopy equivalence, assuming that the fundamental group of each summand is "good" in the…

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

Two 4-manifolds are stably diffeomorphic if they become diffeomorphic after connected sum with S^2 x S^2's. This paper shows that two closed, orientable, homotopy equivalent, smooth 4-manifolds are stably diffeomorphic, provided a certain…

Together with F. Morel, we have constructed in \cite{CR, Cobord1, Cobord2} a theory of {\em algebraic cobordism}, an algebro-geometric version of the topological theory of complex cobordism. In this paper, we give a survey of the…

Kriesel conjectured that every minimally $1$-tough graph has a vertex with degree precisely $2$. Katona and Varga (2018) proposed a generalized version of this conjecture which says that every minimally $t$-tough graph has a vertex with…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…