Search arXivSearch

arXiv · 2606.29183

No involutions in the missing Moore graph

Abstract

The existence of a Moore graph of degree $57$ is the last open case in the Hoffman-Singleton classification of Moore graphs of diameter two. We prove that such a graph, if one exists, has no involutory automorphisms; consequently its automorphism group has odd order. The proof relies on a new trace-rank identity, valid for every finite graph and obtained from the Brauer quotient of $p$-permutation lattices: the trace of an automorphism of prime order $p$ on a spectral summand whose projection idempotent preserves $p$-adic permutation lattice equals the rank, over the residue field of characteristic $p$, of the corresponding idempotent restricted to the fixed vertices. For strongly regular graphs, this upgrades the classical character-value congruences for prime-order automorphisms to exact rank equalities. As further applications, the identity yields new restrictions on automorphisms of odd prime order of the hypothetical Moore graph, and it sharpens known automorphism analyses of other hypothetical strongly regular graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yawara Ishida. 2026-07-08. No involutions in the missing Moore graph. https://arxiv.org/abs/2606.29183

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO