English
Related papers

Related papers: Facial diagrams and cycle double cover

200 papers

We prove the following conjecture of S. Thomass\'e: for every (potentially infinite) digraph $ D $ it is possible to iteratively reverse directed cycles in such a way that the dichromatic number of the final reorientation $ D^{*} $ of $ D $…

Combinatorics · Mathematics 2020-07-22 Paul Ellis , Attila Joó , Dániel T. Soukup

We provide the first non-trivial examples of quasi-isometric embeddings between curve complexes. These are induced either by puncturing a closed surface or via orbifold coverings. As a corollary, we give new quasi-isometric embeddings…

Geometric Topology · Mathematics 2014-11-11 Kasra Rafi , Saul Schleimer

Let $G$ be a bridgeless cubic graph. Consider a list of $k$ 1-factors of $G$. Let $E_i$ be the set of edges contained in precisely $i$ members of the $k$ 1-factors. Let $\mu_k(G)$ be the smallest $|E_0|$ over all lists of $k$ 1-factors of…

Combinatorics · Mathematics 2015-09-22 Eckhard Steffen

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

Geometric Topology · Mathematics 2018-10-23 Sunrose T. Shrestha

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

Combinatorics · Mathematics 2015-11-23 Ivan Izmestiev

Let $P$ be a cubic $3$-connected bipartite plane graph which has a $2$-factor which consists only of facial $4$-cycles, and suppose that $P^{*}$ is the dual graph. We show that $P$ has at least $3^{\frac{2|P^{*}|}{\Delta^{2}{(P^{*})}}}$…

Combinatorics · Mathematics 2018-11-06 Jan Florek

We construct branched double coverings by certain direct products of manifolds for connected sums of copies of sphere bundles over the 2-sphere. As an application we answer a question of Kotschick and Loeh up to dimension five. More…

Geometric Topology · Mathematics 2019-09-09 Christoforos Neofytidis

A cycle $C$ in a graph $G$ is called a Tutte cycle if, after deleting $C$ from $G$, each component has at most three neighbors on $C$. Tutte cycles play an important role in the study of Hamiltonicity of planar graphs. Thomas and Yu and…

Combinatorics · Mathematics 2024-12-30 Michael C. Wigal , Xingxing Yu

We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…

Combinatorics · Mathematics 2007-05-23 François Genest

New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…

Group Theory · Mathematics 2024-05-16 Henry Wilton

We explore the well-known Jaeger's directed cycle double cover conjecture which is equivalent to the assertion that every cubic bridgeless graph has an embedding on a closed orientable surface with no dual loop. We associate each cubic…

Combinatorics · Mathematics 2013-10-22 Andrea Jiménez , Martin Loebl

We present existence results for certain singular 2-dimensional foliations on 4-manifolds. The singularities can be chosen to be simple, e.g. the same as those that appear in Lefschetz pencils. There seems to be a wealth of such creatures…

Geometric Topology · Mathematics 2014-10-01 Alexandru Scorpan

In computer-aided design (CAD) systems, 2D line drawings are commonly used to illustrate 3D object designs. To reconstruct the 3D models depicted by a single 2D line drawing, an important key is finding the edge loops in the line drawing…

Computer Vision and Pattern Recognition · Computer Science 2022-03-09 Kehan Wang , Jia Zheng , Zihan Zhou

A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are half-planes bounded by that line. Two-page book embeddings, i.e., book embeddings into 2…

Data Structures and Algorithms · Computer Science 2024-04-23 Robert Ganian , Haiko Mueller , Sebastian Ordyniak , Giacomo Paesani , Mateusz Rychlicki

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. The weight of a cycle cover of an edge-weighted graph is…

Data Structures and Algorithms · Computer Science 2007-05-23 Bodo Manthey

Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…

Combinatorics · Mathematics 2022-06-22 Adam Tyc

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

This paper deals with cyclic covers of a large family of rational normal surfaces that can also be described as quotients of a product, where the factors are cyclic covers of algebraic curves. We use a generalization of Esnault-Viehweg…

Algebraic Geometry · Mathematics 2023-04-20 Enrique Artal Bartolo , José Ignacio Cogolludo-Agustín , Jorge Martín-Morales

By using double branched covers, we prove that there is a 1-1 correspondence between the set of knotoids in the 2-sphere, up to orientation reversion and rotation, and knots with a strong inversion, up to conjugacy. This correspondence…

Geometric Topology · Mathematics 2019-09-26 Agnese Barbensi , Dorothy Buck , Heather A. Harrington , Marc Lackenby

Considering regions in a map to be adjacent when they have nonempty intersection (as opposed to the traditional view requiring intersection in a linear segment) leads to the concept of a facially complete graph: a plane graph that becomes…

Combinatorics · Mathematics 2024-09-18 James Tilley , Stan Wagon , Eric Weisstein
‹ Prev 1 3 4 5 6 7 10 Next ›