English
Related papers

Related papers: Path-cordial abelian groups

200 papers

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such…

Combinatorics · Mathematics 2017-07-12 Yan-Quan Feng , Istvan Kovacs , Da-Wei Yang

We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…

Combinatorics · Mathematics 2015-08-11 Simona Bonvicini , Tomaž Pisanski

The full automorphism group of a certain elementary abelian $p$-cover of the Hermitian curve in characteristic $p>0$ is determined. It is remarkable that the order of Sylow $p$-groups of the automorphism group is close to Nakajima's bound…

Algebraic Geometry · Mathematics 2022-10-06 Herivelto Borges , Satoru Fukasawa

The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…

Combinatorics · Mathematics 2021-11-05 Jiyong Chen , Cai Heng Li , Cheryl E. Praeger , Shu-Jiao Song

A graph is locally chordal if each of its small-radius balls is chordal. In an earlier work [AKK25], the authors and Kobler proved that locally chordal graphs can be characterized by having chordal local covers, by forbidding short cycles…

Combinatorics · Mathematics 2025-12-23 Tara Abrishami , Paul Knappe

A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…

Group Theory · Mathematics 2020-02-18 Alan McLeay

If $H$ is (or is isomorphic to) a subgraph of $G$, $H$ is said to {\it divide} $G$ if there is an edge-decomposition of $G$ by copies of $E(H)$, the edge set of $H$. A more restrictive version of this is when there is a subgroup ${\cal H}$…

Combinatorics · Mathematics 2013-09-06 Michel Mollard , Mark Ramras

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

Group Theory · Mathematics 2024-12-17 Murray Elder , Giles Gardam , Adam Piggott , Davide Spriano , Kane Townsend

We explicitly describe cycle-class maps c_H from motivic cohomology to absolute Hodge cohomology, for smooth quasi-projective and (some) proper singular varieties, and compute special cases of the latter. For smooth projective varieties, we…

Algebraic Geometry · Mathematics 2009-11-11 Matt Kerr , James D. Lewis

Given a graph G=(V, E), a vertex is said to ve-dominate an edge if it is either incident with the edge or adjacent to one of its endpoints. A set of vertices is a ve-dominating set if it ve-dominates every edge of the graph. We introduce…

Combinatorics · Mathematics 2025-12-16 Yasemin Büyükçolak

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

Combinatorics · Mathematics 2023-04-20 Babak Miraftab , Dave Witte Morris

Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A…

Discrete Mathematics · Computer Science 2018-03-22 Sérgio H. Nogueira , Vinicius F. dos Santos

We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest…

Group Theory · Mathematics 2025-04-29 Nima Hoda , Jacek Świątkowski

The geometric torsion conjecture asserts that the torsion part of the Mordell--Weil group of a family of abelian varieties over a complex quasiprojective curve is uniformly bounded in terms of the genus of the curve. We prove the conjecture…

Algebraic Geometry · Mathematics 2015-04-09 Benjamin Bakker , Jacob Tsimerman

A graph $G$ is called equiarboreal if the number of spanning trees containing a given edge in $G$ is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], Godsil proved that any graph which is a colour class in an…

Combinatorics · Mathematics 2025-12-30 Wensheng Sun , Yujun Yang , Shou-Jun Xu

For a commutative ring $A$ we consider a related graph, $\Gamma(A)$, whose vertices are the unimodular rows of length $2$ up to multiplication by units. We prove that $\Gamma(A)$ is path-connected if and only if $A$ is a…

K-Theory and Homology · Mathematics 2022-02-17 Kevin Hutchinson

In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph $X$ in the group of symmetries of the Jacobian of $X$. As a consequence we show that if a $3$-edge-connected graph…

Combinatorics · Mathematics 2024-07-19 István Estélyi , Ján Karabáš , Alexander Mednykh , Roman Nedela

We study the groups of rational points of abelian varieties defined over a finite field $ \mathbb{F}_q$ whose endomorphism rings are commutative, or, equivalently, whose isogeny classes are determined by squarefree characteristic…

Number Theory · Mathematics 2025-02-26 Stefano Marseglia , Caleb Springer

It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…

Combinatorics · Mathematics 2025-10-08 Martin Milanič , Đorđe Mitrović

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…

Combinatorics · Mathematics 2019-08-14 Yan-Quan Feng , István Kovács , Jie Wang , Da-Wei Yang