English
Related papers

Related papers: Toroidal Cartesian Products Where One Factor is 3-…

200 papers

To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…

Geometric Topology · Mathematics 2008-08-21 T. Fiedler , V. Kurlin

We study when the adjacency matrix of a Cayley graph factors as the product of two adjacency matrices of Cayley graphs. Let $G$ be a finite group and let $U\subseteq G\setminus \{e\}$ be symmetric. Writing $A(G;U)$ for the adjacency matrix…

Combinatorics · Mathematics 2025-12-22 Allen W. Herman , Bobby Miraftab

We briefly report on our result that the braided tensor product algebra of two module algebras $A_1,A_2$ of a quasitriangular Hopf algebra $H$ is equal to the ordinary tensor product algebra of $H_1$ with a subalgebra isomorphic to $A_2$…

Quantum Algebra · Mathematics 2009-10-31 Gaetano Fiore , Harold Steinacker , Julius Wess

We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.

Combinatorics · Mathematics 2021-07-20 Oliver Knill

Let $G$ be a finite group. We show that if $|G| = pqrs$, where $p$, $q$, $r$, and $s$ are distinct odd primes, then every connected Cayley graph on $G$ has a hamiltonian cycle.

Combinatorics · Mathematics 2021-08-02 Dave Witte Morris

A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. Manikandan and Paulraja conjectured that if $G$ and $H$ are Hamilton cycle decomposable circulant graphs with at least one of them is…

Combinatorics · Mathematics 2017-03-10 P. Paulraja , S. Sampath Kumar

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 2023-06-21 Ligang Jin , Eckhard Steffen

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

Computational Geometry · Computer Science 2023-03-28 Marc Alexa

In this paper the number of ways to glue together several polygons into a surface of genus $g$ has been investigated. We've given an elementary proof on the formula for the generating function $\mathbf{C}_g^{[2]}(z)$ of the number of…

Combinatorics · Mathematics 2014-07-22 Alexei Pastor

We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let $G$ be a planar triangulation. Then the dual $G^*$ is a cubic…

Combinatorics · Mathematics 2013-12-16 Helmut Alt , Michael S. Payne , Jens M. Schmidt , David R. Wood

Let $G$ and $H$ be two simple graphs and let $G*H$ denotes the graph theoretical product of $G$ by $H$. In this paper we provide some results on graded Betti numbers, Castelnuovo-Mumford regularity, projective dimension, $h$-vector, and…

Commutative Algebra · Mathematics 2011-01-10 Amir Mousivand

We classify all smooth compact connected K\"ahler threefolds that admit the structure of a $C^\infty$-fiber bundle over the circle. This generalizes the work of Hao and Schreieder in the projective case. In contrast to the projective case,…

Algebraic Geometry · Mathematics 2025-06-30 Simon Pietig

Let $\mathcal{G}(k)$ denote the set of connected $k$-regular graphs $G$, $k\geq2$, where the number of vertices at distance 2 from any vertex in $G$ does not exceed $k$. Asratian (2006) showed (using other terminology) that a graph…

Combinatorics · Mathematics 2021-07-16 Armen S. Asratian , Jonas B. Granholm

Suppose that a compact $r$-dimensional torus $T^r$ acts in a holomorphic and Hamiltonian manner on polarized complex $d$-dimensional projective manifold $M$, with nowhere vanishing moment map $\Phi$. Assuming that $\Phi$ is transverse to…

Symplectic Geometry · Mathematics 2022-05-24 Roberto Paoletti

Chv\'{a}tal conjectured in 1973 the existence of some constant $t$ such that all $t$-tough graphs with at least three vertices are hamiltonian. While the conjecture has been proven for some special classes of graphs, it remains open in…

Combinatorics · Mathematics 2021-06-15 Andrew Hatfield , Elizabeth Grimm

It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the…

Discrete Mathematics · Computer Science 2015-01-27 Marc Hellmuth , Manuel Noll , Lydia Ostermeier

Suppose that an algebraic torus $G$ acts algebraically on a projective manifold $X$ with generically trivial stabilizers. Then the Zariski closure of the set of pairs $\{(x,y)\in X\times X\mid y=gx \text{for some}g\in G\}$ defines a nonzero…

Symplectic Geometry · Mathematics 2007-05-23 Ignasi Mundet-i-Riera

We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that…

Combinatorics · Mathematics 2009-09-11 Joseph P. S. Kung , Gordon F. Royle

Let $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpi\'{n}ski product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times V(H)$,…

Combinatorics · Mathematics 2023-09-28 Michael A. Henning , Sandi Klavžar , Ismael G. Yero

We show that if X is a smooth rationally connected threefold and C is a smooth projective curve then C can be embedded in X. Furthermore, a version of this property characterises rationally connected varieties of dimension at least 3. We…

Algebraic Geometry · Mathematics 2010-02-05 G. K. Sankaran