English
Related papers

Related papers: On 2-complexes embeddable in 4-space, and the excl…

200 papers

We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…

Geometric Topology · Mathematics 2026-05-11 Nathan Huber , Ishaan Raghavendra Rao , Hannah Schwartz Joseph , Tanishga Thankaraj Vijay

It is well known that under mild conditions on a connected topological space $\mathcal X$, connected covers of $\mathcal X$ may be classified via conjugacy classes of subgroups of the fundamental group of $\mathcal X$. In this paper, we…

Group Theory · Mathematics 2015-12-01 John Meakin , Nóra Szakács

We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…

Computational Geometry · Computer Science 2016-04-11 Salman Parsa

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

Combinatorics · Mathematics 2011-01-14 Bojan Mohar

The vanishing of Van Kampen's obstruction is known to be necessary and sufficient for embeddability of a simplicial n-complex into $R^{2n}$ for $n\neq 2$, and it was recently shown to be incomplete for $n=2$. We use algebraic-topological…

Geometric Topology · Mathematics 2007-05-23 Vyacheslav S. Krushkal

Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…

Discrete Mathematics · Computer Science 2014-01-06 Michael A. Bekos , Martin Gronemann , Chrysanthi N. Raftopoulou

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a…

Metric Geometry · Mathematics 2020-08-06 Karim A. Adiprasito , Bruno Benedetti

We introduce the class of outerspatial 2-complexes as the natural generalisation of the class of outerplanar graphs to three dimensions. Answering a question of O-joung Kwon, we prove that a locally 2-connected 2-complex is outerspatial if…

Combinatorics · Mathematics 2023-03-31 Johannes Carmesin , Tsvetomir Mihaylov

We consider an embedding of a $2$-dimensional CW complex into the $3$-sphere, and construct it's dual graph. Then we obtain a homogeneous system of linear equations from the $2$-dimensional CW complex in the first homology group of the…

Geometric Topology · Mathematics 2015-03-31 Kazufumi Eto , Shosaku Matsuzaki , Makoto Ozawa

We study smooth, proper embeddings of noncompact surfaces in 4-manifolds, focusing on exotic planes and annuli, i.e., embeddings pairwise homeomorphic to the standard embeddings of R^2 and R^2-int D^2 in R^4. We encounter two uncountable…

Geometric Topology · Mathematics 2025-01-08 Robert E. Gompf

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

Combinatorics · Mathematics 2014-02-10 Vassily Olegovich Manturov

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

Combinatorics · Mathematics 2012-12-27 Tyler Friesen , Vassily Manturov

Firstly, we characterise the embeddability of simply connected locally 3-connected 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski's characterisation of graph planarity, by nine excluded minors. This answers…

Combinatorics · Mathematics 2023-09-28 Johannes Carmesin

A graph $G$ admiting a $2$-factor is \textit{pseudo $2$-factor isomorphic} if the parity of the number of cycles in all its $2$-factors is the same. In [M. Abreu, A.A. Diwan, B. Jackson, D. Labbate and J. Sheehan. Pseudo $2$-factor…

Combinatorics · Mathematics 2022-07-25 M. Abreu , M. Funk , D. Labbate , F. Romaniello

We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…

Combinatorics · Mathematics 2021-05-20 Victor Chepoi , Kolja Knauer , Manon Philibert

The fact that the complete graph $K_5$ does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph…

Combinatorics · Mathematics 2016-10-31 Xavier Goaoc , and Isaac Mabillard , Pavel Paták , Zuzana Patáková , Martin Tancer , Uli Wagner

We observe that many of the 2-complexes constructed by Freedman-Krushkal-Teichner in their paper on the incompleteness of the van Kampen embedding obstruction can actually be PL immersed in $\mathbb{R}^4$ in such a way that the images of…

Geometric Topology · Mathematics 2022-06-28 T. Tam Nguyen Phan

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some…

Combinatorics · Mathematics 2009-11-17 M. N. Ellingham , Xiaoya Zha

We consider a 2-complex in a particular form, called the Quinn model of a 2-complex. It can be sliced in graphs, where a change from one graph to another can be organized by a sequence of local transitions, which are described in a list of…

Geometric Topology · Mathematics 2010-12-13 Holger Kaden

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

Combinatorics · Mathematics 2014-01-14 Rajneesh Hegde , Robin Thomas
‹ Prev 1 2 3 10 Next ›