English
Related papers

Related papers: The complete classification of triply-transitive s…

200 papers

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Computational Geometry · Computer Science 2017-03-21 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

Logic · Mathematics 2019-08-16 John Clemens , Samuel Coskey , Stephanie Potter

We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V|)+1 where V is the set of vertices of the graph.…

Combinatorics · Mathematics 2016-07-07 Sylvain Gravier , Aline Parreau , Sara Rottey , Leo Storme , Elise Vandomme

We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…

Operator Algebras · Mathematics 2026-02-16 Néstor Bravo Hernández , Roberto Hernández Palomares , Fabio Viales Solís

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

Combinatorics · Mathematics 2020-08-17 Alex Schaefer , Eric Swartz

In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…

Combinatorics · Mathematics 2026-04-28 Jiangmin Pan , Cixuan Wu , Yingnan Zhang , Hanlin Zou

We give necessary and sufficient conditions for the Terwilliger algebra of a quasi-thin Schurian association scheme to coincide with: (a) the centralizer algebra of a point stabilizer of its automorphism group, and (b) its subspace $T^0$.…

Combinatorics · Mathematics 2025-10-21 Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

By proving precisely which singularity index lists arise from the pair of invariant foliations for a pseudo-Anosov surface homeomorphism, Masur and Smillie determined a Teichm\"uller flow invariant stratification of the space of quadratic…

Group Theory · Mathematics 2014-09-09 Catherine Pfaff

In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…

Combinatorics · Mathematics 2018-06-05 Attila Sali , Gábor Simonyi , Gábor Tardos

A Cayley Graph for a group $G$ is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of $G$ (the normaliser of a regular copy of $G$ in $\operatorname{Sym}(G)$). We complete the…

Combinatorics · Mathematics 2014-01-10 Brian P. Corr , Cheryl E. Praeger

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…

Combinatorics · Mathematics 2024-03-05 Oswin Aichholzer , Joachim Orthaber , Birgit Vogtenhuber

The $t$-vertex condition, for an integer $t\ge 2$, was introduced by Hestenes and Higman in 1971, providing a combinatorial invariant defined on edges and non-edges of a graph. Finite rank 3 graphs satisfy the condition for all values of…

Combinatorics · Mathematics 2014-01-28 Sven Reichard

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

Combinatorics · Mathematics 2023-03-02 Daniel R. Hawtin , Jin-Xin Zhou , Cheryl E. Praeger

For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…

Combinatorics · Mathematics 2019-06-26 Gareth A. Jones

Let $G$ be a group and $Z(G)$ be its center. We associate a commuting graph ${\Gamma}(G)$, whose vertex set is $G\setminus Z(G)$ and two distinct vertices are adjacent if they commute. We say that ${\Gamma}(G)$ is strong $k$ star free if…

Group Theory · Mathematics 2022-12-12 Sushil Bhunia , G. Arunkumar

Twelve new strongly regular graphs with parameters (81,30,9,12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs that arise from 2-weight codes. One of these new graphs is…

Combinatorics · Mathematics 2020-10-02 Dean Crnković , Andrea Švob , Vladimir D. Tonchev

We establish Thom's jet transversality theorem for regular maps from an affine algebraic manifold to an algebraic manifold satisfying a suitable flexibility condition. It can be considered as the algebraic version of Forstneri\v{c}'s jet…

Algebraic Geometry · Mathematics 2022-12-13 Yuta Kusakabe

In this paper, we investigate the closure of a large class of Teichm\"uller discs in the stratum Q(1,1,1,1) or equivalently, in a GL^+_2(R)-invariant locus L of translation surfaces of genus three. We describe a systematic way to prove that…

Geometric Topology · Mathematics 2007-07-06 Pascal Hubert , Erwan Lanneau , Martin Moeller

We prove an upper bound on the number of pairwise strongly cospectral vertices in a normal Cayley graph, in terms of the multiplicities of its eigenvalues. We use this to determine an explicit bound in Cayley graphs of $\mathbb{Z}_2^d$ and…

Combinatorics · Mathematics 2023-05-19 Arnbjörg Soffía Árnadóttir , Chris Godsil

The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…

Combinatorics · Mathematics 2026-04-17 Alison Charlesworth , Christopher Ramsey , Nicolae Strungaru