English
Related papers

Related papers: On the critical group of the missing Moore graph

200 papers

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

Combinatorics · Mathematics 2016-07-12 Yan-Quan Feng , Klavdija Kutnar , Dragan Marusic , Da-Wei Yang

Let $C(d,k)$ and $AC(d,k)$ be the largest order of a Cayley graph and a Cayley graph based on an abelian group, respectively, of degree $d$ and diameter $k$. When $k=2$, it is well-known that $C(d,2)\le d^2+1$ with equality if and only if…

Combinatorics · Mathematics 2015-06-19 Alexander Pott , Yue Zhou

A connected $k$-chromatic graph $G$ is double-critical if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. The only known double-critical $k$-chromatic graph is the complete $k$-graph $K_k$. The conjecture that there…

Combinatorics · Mathematics 2008-10-20 Ken-ichi Kawarabayashi , Anders Sune Pedersen , Bjarne Toft

Given a finitely generated, torsion-free nilpotent group, we find the maximum possible (critical) regularity for its faithful actions by diffeomorphisms of the closed or half-open interval and of the circle. Our result gives an expression…

Dynamical Systems · Mathematics 2026-03-31 Maximiliano Escayola , Victor Kleptsyn

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…

Combinatorics · Mathematics 2019-06-25 Jiangmin Pan , Junjie Huang , Chao Wang

We show that if the principal p-block of a finite group G contains exactly 5 irreducible ordinary characters, then a Sylow p-subgroup of G has order 5, 7 or is isomorphic to one of the non-abelian 2-groups of order 8.

Group Theory · Mathematics 2021-05-07 Noelia Rizo , Amanda Schaeffer Fry , Carolina Vallejo

In this paper, we take a modest first step towards a systematic study of chromatic numbers of Cayley graphs on abelian groups. We lose little when we consider these graphs only when they are connected and of finite degree. As in the work of…

Combinatorics · Mathematics 2023-11-14 Jonathan Cervantes , Mike Krebs

We consider graphs $G$ with $\Delta=3$ such that $\chi'(G)=4$ and $\chi'(G-e)=3$ for every edge $e$, so-called \emph{critical} graphs. Jakobsen noted that the Petersen graph with a vertex deleted, $P^*$, is such a graph and has average…

Combinatorics · Mathematics 2018-06-19 Daniel W. Cranston , Landon Rabern

Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this…

Combinatorics · Mathematics 2011-07-08 Farbod Shokrieh

We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…

Combinatorics · Mathematics 2025-04-02 Paul-Henry Leemann , Mikael de la Salle

The $L$-matrix $A_s=[1/(n+s)]$ was introduced in \cite{MRtmp}. As a surprising property, we showed that its 2-norm is constant for $s \geq s_0$, where the critical point $s_0$ is unknown but relies in the interval $(1/4,1/2)$. In this note,…

Functional Analysis · Mathematics 2021-09-13 Ludovick Bouthat , Javad Mashreghi

The sandpile group of a connected graph $G$, defined to be the torsion part of the cokernel of the graph Laplacian, is a subtle graph invariant with combinatorial, algebraic, and geometric descriptions. Extending and improving previous…

Combinatorics · Mathematics 2024-04-18 Jiyang Gao , Jared Marx-Kuo , Vaughan McDonald , Chi Ho Yuen

The Laplacian of a (weighted) Cayley graph on the Weyl group $W(B_n)$ is a $N\times N$ matrix with $N = 2^n n!$ equal to the order of the group. We show that for a class of (weighted) generating sets, its spectral gap (lowest nontrivial…

Combinatorics · Mathematics 2019-09-12 Filippo Cesi

A maximal minor $M$ of the Laplacian of an $n$-vertex Eulerian digraph $\Gamma$ gives rise to a finite group $\mathbb{Z}^{n-1}/\mathbb{Z}^{n-1}M$ known as the sandpile (or critical) group $S(\Gamma)$ of $\Gamma$. We determine $S(\Gamma)$ of…

Combinatorics · Mathematics 2014-11-04 Swee Hong Chan , Henk D. L. Hollmann , Dmitrii V. Pasechnik

This note answers a question posed by Levine in arkiv:math.CO/0906.2809. The main result is Theorem 1 which shows that under certain circumstances a critical group of a directed graph is the quotient of a critical group of its directed line…

Combinatorics · Mathematics 2010-11-24 David Perkinson , Nicholas Salter , Tianyuan Xu

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

Spectral Theory · Mathematics 2019-10-04 J. B. Kennedy

Given a manifold $M$, some closed $\beta\in\Omega^1(M)$ and a map $f\in C^\infty(M)$, a $\beta$-critical point is some $x\in M$ such that $d_\beta f_{x}=0$ for the Lichnerowicz derivative $d_\beta$. In this paper, we will give a lower bound…

Symplectic Geometry · Mathematics 2025-02-13 Adrien Currier

In 2020, a paper [arXiv:2010.13443] appeared in the arXiv claiming to prove that a Moore graph of diameter 2 and degree 57 does not exist. (The paper is in Russian; we include a link to a translation of this paper kindly provided to us by…

Combinatorics · Mathematics 2023-03-01 Vance Faber , Jonathan Keegan

A graph is $k$-critical if it is $k$-chromatic but each of its proper induced subgraphs is ($k-1$)-colorable. It is known that the number of $4$-critical $P_5$-free graphs is finite, but there is an infinite number of $k$-critical…

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Combinatorics · Mathematics 2020-05-26 Joy Morris , Josip Smolcic