English
Related papers

Related papers: Classification of nonorientable regular embeddings…

200 papers

Expanding on work by Conway, Orson, and Powell, we study the isotopy classes rel. boundary of nonorientable, compact, locally flatly embedded surfaces in $D^4$ with knot group $\mathbb{Z}_2$. In particular we show that if two such surfaces…

Geometric Topology · Mathematics 2024-02-29 Mark Pencovitch

Let $K$ be a nontrivial knot. For each $n\in \mathbb{N}$, we prove that the rank of its $n$th iterated Whitehead doubled knot group $\pi_1(S^3 \setminus \operatorname{WD}^n(K))$ is bounded below by $n+1$. As an application, we show that…

Geometric Topology · Mathematics 2025-10-09 Shijie Gu , Jian Wang , Yanqing Zou

Let EMBED(k,d) be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into R^d? Known results easily imply polynomiality of EMBED(k,2) (k=1,2;…

Computational Geometry · Computer Science 2009-04-22 Jiří Matoušek , Martin Tancer , Uli Wagner

Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}.

Combinatorics · Mathematics 2013-08-21 Amin Coja-Oghlan , Charilaos Efthymiou , Samuel Hetterich

Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove that if $H$ has Ore-degree at most 5 and $G$ has minimum degree at least $2n/3$ then $H\subset G.$

Combinatorics · Mathematics 2019-01-01 Béla Csaba , Judit Nagy-György

We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…

Computational Geometry · Computer Science 2013-10-11 Éric Colin de Verdière , Arnaud de Mesmay

Given a nonorientable, locally flatly embedded surface in the $4$-sphere of nonorientable genus $h$, Massey showed that the normal Euler number lies in $\lbrace -2h,-2h+4,\ldots,2h-4,2h \rbrace$. We prove that every such surface with knot…

Geometric Topology · Mathematics 2024-11-26 Anthony Conway , Patrick Orson , Mark Powell

We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the…

Computational Geometry · Computer Science 2018-03-20 Éric Colin de Verdière , Thomas Magnard , Bojan Mohar

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$-valent one-regular graphs of order $5p^2$, where $p$ is a prime, are classified

Combinatorics · Mathematics 2021-08-11 Mohsen Ghasemi , Rezvan Varmazyar

An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…

Combinatorics · Mathematics 2024-02-07 Jia Zhou , Zhilan Wang , Jin Yan

In this paper we determine all singular endomorphisms of the Hamming graph and other related graphs. The Hamming graph has vertices $\mathbb{Z}^{m}_n$ where two vertices are adjacent, if their Hamming distance is $1$. We show that its…

Combinatorics · Mathematics 2016-02-09 Artur Schaefer

Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid…

Discrete Mathematics · Computer Science 2014-10-10 Asghar Asgharian Sardroud , Alireza Bagheri

We introduce, for every surface {\Sigma}, a two-way connection between FO transductions (first-order logical transformations) of the graphs embeddable in {\Sigma} and a certain variant of fan-crossing drawings of graphs in {\Sigma}. If the…

Computational Geometry · Computer Science 2026-03-13 Petr Hliněný , Jan Jedelský

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically…

Geometric Topology · Mathematics 2017-12-29 Thomas Fleming , Joel Foisy

In this paper we prove that random $d$--regular graphs with $d\geq 3$ have traffic congestion of the order $O(n\log_{d-1}^{3}(n))$ where $n$ is the number of nodes and geodesic routing is used. We also show that these graphs are not…

Metric Geometry · Mathematics 2012-03-23 Gabriel H. Tucci

We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular,…

Computational Geometry · Computer Science 2007-05-23 C. A. Duncan , A. Efrat , C. Erten , S. Kobourov , J. S. B. Mitchell

For any $H$ in (0,1/2), we construct complete, non-proper, stable, simply-connected surfaces embedded in $H^2xR$ with constant mean curvature $H$.

Differential Geometry · Mathematics 2018-03-06 Baris Coskunuzer , William H. Meeks , Giuseppe Tinaglia

Let $H$ be a fixed graph. A {\em fractional $H$-decomposition} of a graph $G$ is an assignment of nonnegative real weights to the copies of $H$ in $G$ such that for each $e \in E(G)$, the sum of the weights of copies of $H$ containing $e$…

Combinatorics · Mathematics 2007-05-23 Raphael Yuster

We study the regularity of the isometric embedding X: (B(O,r),g) -> (R3, gcan) of a 2-ball with nonnegatively curved C4 metric into R3. Under the assumption that X can be expressed in the graph form, we show X is C2,1 near P, which is…

Analysis of PDEs · Mathematics 2018-06-19 Xumin Jiang

We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their…

Combinatorics · Mathematics 2016-08-26 Erica Flapan , Sarah Rundell , Madeline Wyse
‹ Prev 1 3 4 5 6 7 10 Next ›