Less is Moore

Paul Stankovski Wagner

Home/Archive/arXiv

arXiv · 2610.04815

Less is Moore

Paul Stankovski Wagner

View original source ↗Read source document ↗Export metadata ↓

Abstract

A Moore graph simultaneously asks for two things that normally pull in opposite directions: every vertex should have many neighbors, while every pair of vertices should remain close. For diameter two and degree $k$, the Moore bound is $k^2+1$, and equality forces a remarkably rigid graph: it is strongly regular with parameters $(k^2+1,k,0,1)$. Hoffman and Singleton showed that such a graph can exist only for $k=2,3,7$, and possibly 57. The degree-57 case on 3,250 vertices remains open. This paper is not an attempt to settle that open problem. Instead, we ask a more algorithmic question: How efficiently can the defining Moore structure itself be searched exactly? We begin from a human-developed exhaustive search based on the radius-two Moore tree. Leaves fall into $k$ groups of size $k-1$, and the edges between every pair of such groups form a perfect matching - a permutation. For efficiency, a partial construction is abandoned immediately when it creates a triangle or quadrangle. We then describe a sequence of exact algorithm-engineering improvements developed through a human-guided AI process and accepted only after mathematical checking and controlled regression tests. The main steps are reversible short-cycle forbid counters, bit-parallel domains, minimum-remaining-value branching, singleton propagation, matching-based AllDifferent filtering, balanced replayable parallel frontiers, residual-symmetry orbit pruning, and canonical deduplication of frontier states. On the principal $k=9$ benchmark, stronger symmetry cuts wall time from 47.6 to 17.9 seconds on a six-core laptop setup. Further parallelization speedup is reported separately; on a 16-core/32-thread machine, median wall time is reduced to 5.28 seconds. Degrees 10 and 57 are used as stress tests, and a five-minute degree-57 run uses only 161 MiB peak resident memory, showing that state size is modest.

Explore related subjects

cs.DM math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Paul Stankovski Wagner. 2026-10-03. Less is Moore. https://arxiv.org/abs/2610.04815

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

KEEP EXPLORING

Related papers

arXiv2026

Multi-Capacity Online Assortment Optimization with Consecutive Stays under Markov Chain Choice

We study online assortment optimization under Markov chain choice and independent Bernoulli arrivals, with each period's request type known in advance. Each product may have multiple interchangeable physical copies, and each booking reserves consecutive service slots on a single copy. Customers choose among products, while the platform assigns purchases to feasible copies. We develop a sales-based relaxation that upper-bounds the optimal online revenue and use it to design a policy with two components: independent sampling and purchase--update coupling. We generate independent copy proposals and make a product eligible whenever at least one of its copies proposes. A general revenue-extraction bound for random candidate sets with independent product inclusions shows that optimizing over eligible products recovers at least half of each period's relaxation revenue benchmark in expectation. A purchase--update coupling reproduces the interval flows through independent virtual copy updates while preserving physical feasibility. Under general Markov chain choice, the policy uses a random gate to make the coupling feasible: it offers the selected assortment with probability $1-1/e$ and the empty assortment otherwise. No gate is needed under multinomial logit (MNL) choice. The resulting policies achieve approximation ratios of $(1-1/e)/2$ and $1/2$, respectively, relative to the optimal nonanticipative online policy, independently of product capacities. In the single-copy MNL setting, our policy improves the guarantee of \citet{huwu2026} from $0.271$ to $1/2$ under the same arrival convention. The $1/2$ static extraction factor and the $1-1/e$ uniform scalar-gate factor are separately sharp, and the $1/2$ MNL guarantee is tight for the proposed policy.

cs.DM↗

arXiv2026

Euclidean Embeddings of Acyclic Hypergraph Line Metrics

We study Euclidean embeddings of higher-order line metrics arising from hypergraphs. For a fixed threshold $s\geq 1$, the $s$-line graph $L_s(H)$ has one vertex for each hyperedge of $H$, with two hyperedges adjacent when they intersect in at least $s$ vertices; its shortest-path metric is the native $s$-line metric. In the unrestricted setting, every finite graph occurs as the $s$-line graph of some hypergraph, so the worst-case Euclidean distortion is $Θ(\log n)$. We show that $α$-acyclicity yields a sharp improvement to $Θ(\sqrt{\log\log n})$. Although the canonical join tree of an $α$-acyclic hypergraph may have arbitrarily large stretch relative to the native metric, we prove that for every $s$, the $s$-line graphs of $α$-acyclic hypergraphs are exactly the dually chordal graphs. Using their constant-factor spanning-tree approximations together with classical tree-embedding bounds, we obtain an $O(\sqrt{\log\log n})$ Euclidean embedding bound. We then show this is asymptotically tight by realizing every finite tree as the $s$-line graph of an $α$-acyclic hypergraph. Thus, the worst-case distortion is $Θ(\sqrt{\log\log n})$, including for hypergraphs of rank at most $3s+1$.

cs.DM↗

arXiv2026

Degree Stability of Parallel Greedy Matching in Random Graphs

We study a natural synchronous greedy matching process in Erdős-Rényi random graphs $\mathbb{G}(n,p)$ and give a rigorous analysis of this parallel stochastic dynamics. The process evolves as follows: in each round, every unmatched vertex proposes to a uniformly random neighbour, and mutually proposing pairs are matched and removed from the graph, after which the process repeats on the residual graph. We consider the density regime $p=Θ(\log^{1+ε} n/n)$ for any constant $ε>0$, which lies just above the threshold for the existence of a perfect matching. We show that, with high probability, for $Θ(\log^{1+ε} n)$ rounds, every unmatched vertex keeps a constant fraction of its initial degree in the residual graph, simultaneously for all vertices and all rounds. By then, the process has matched a constant fraction of the vertices. Our analysis tracks fine-grained invariants that control the evolution of individual vertex degrees, rather than directly tracking the global degree distribution. At the local level, we analyze the per-round degree loss of a vertex via a neighbourhood-exposure martingale. We show that structural sparsity of $\mathbb{G}(n,p)$ yields $O(1)$ variance and thus the per-round degree loss is strongly concentrated around its conditional expectation. At the global level, these local concentration bounds control the increments of a martingale tracking cumulative degree loss over many rounds, allowing us to show that vertex degrees remain stable for $Ω(\log^{1+ε} n)$ rounds.

cs.DM↗