English
Related papers

Related papers: Some Triangulated Surfaces without Balanced Splitt…

200 papers

Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following…

Geometric Topology · Mathematics 2011-05-13 Evgeny Fominykh , Bruno Martelli

A graph $G = (V, E)$ is \emph{partitionable} if there exists a partition $\{A, B\}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph. In this paper we investigate the computational complexity of…

Computational Complexity · Computer Science 2015-01-06 Faisal N. Abu-Khzam , Carl Feghali , Haiko Müller

In 1963, Corr\'adi and Hajnal proved that for all $k \ge 1$ and $n \ge 3k$, every (simple) graph on n vertices with minimum degree at least 2k contains k disjoint cycles. The same year, Dirac described the 3-connected multigraphs not…

Combinatorics · Mathematics 2015-08-21 H. A. Kierstead , A. V. Kostochka , E. C. Yeager

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

Group Theory · Mathematics 2023-07-25 Reymond Akpanya , Tom Goertzen

The strong cycle double cover conjecture states that for every circuit $C$ of a bridgeless cubic graph $G$, there is a cycle double cover of $G$ which contains $C$. We conjecture that there is even a 5-cycle double cover $S$ of $G$ which…

Combinatorics · Mathematics 2012-11-12 Arthur Hoffmann-Ostenhof

The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There…

Combinatorics · Mathematics 2011-12-06 Weiwen Gu

We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…

Combinatorics · Mathematics 2010-11-22 Andrew Treglown

A connected $k$-chromatic graph $G$ with $k \geq 3$ is said to be triangle-critical, if every edge of $G$ is contained in an induced triangle of $G$ and the removal of any triangle from $G$ decreases the chromatic number of $G$ by three. B.…

Combinatorics · Mathematics 2008-02-26 Anders Sune Pedersen

A separating system of a graph $G$ is a family $\mathcal{S}$ of subgraphs of $G$ for which the following holds: for all distinct edges $e$ and $f$ of $G$, there exists an element in $\mathcal{S}$ that contains $e$ but not $f$. Recently, it…

Combinatorics · Mathematics 2024-07-03 Fábio Botler , Tássio Naia

Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges induce a spanning tree of $G$. In this project, we study cyclic base ordering of…

Combinatorics · Mathematics 2022-11-18 Cedric Xia , Joseph Zhang , Allan Zhou

Let $G$ be a finite connected simple graph with $n$ vertices and $m$ edges. We show that, when $G$ is not bipartite, the number of $4$-cycles contained in $G$ is at most $\binom{m-n+1}{2}$. We further provide a short combinatorial proof of…

Combinatorics · Mathematics 2022-11-03 Takayuki Hibi , Aki Mori , Hidefumi Ohsugi

Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…

Discrete Mathematics · Computer Science 2019-08-20 Michele Conforti , Samuel Fiorin , Tony Huynh , Gwenaël Joret , Stefan Weltge

We present a constructive proof that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope $\beta^k$ into closed surfaces of genus $g \leq 1$, each with a transitive automorphism group given by the vertex…

Combinatorics · Mathematics 2019-10-24 Jonathan Spreer

A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…

Geometric Topology · Mathematics 2020-02-17 Charles Daly , Jonah Gaster , Max Lahn , Aisha Mechery , Simran Nayak

We show that on any Riemann surface S of genus g>1 any nonsingular even spin bundle defines e-foloation of S. When a surface is hyperelliptic then all leaves of this foliation are finite and almost all of them consists of 2g+2 points.…

Complex Variables · Mathematics 2013-10-17 K. M. Bugajska

We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Sigma)$, where $\Sigma$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable…

Geometric Topology · Mathematics 2017-10-26 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

We say that $M$ and $S$ form a \textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$, while $0$ has no such representation. The splitting is called {\it…

Combinatorics · Mathematics 2021-01-19 Pingzhi Yuan

Let $\mathcal{C}$ be a $k$-linear category with split idempotents, and $\Sigma:\mathcal{C}\rightarrow\mathcal{C}$ an automorphism. We show that there is an $n$-angulated structure on $(\mathcal{C},\Sigma)$ under certain conditions. As an…

Representation Theory · Mathematics 2015-09-22 Zengqiang Lin

We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…

Dynamical Systems · Mathematics 2017-08-25 Bruno Rodrigues de Freitas , João Carlos Medrado

A non-separating multicurve of a surface S of genus g with m punctures is a multicurve c so that S-c is connected. For k>0 define the graph of non-separting k-multicurves to be the graph whose vertices are non-separating multicurves with k…

Geometric Topology · Mathematics 2013-10-01 Ursula Hamenstaedt