Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1511.03913

We Found the Smallest Non-Autograph

Ben S. Baumer·Yijin Wei·Gary S. Bloom
View original source ↗Read source document ↗Export metadata ↓

Abstract

Suppose that $G$ is a simple, vertex-labeled graph and that $S$ is a multiset. Then if there exists a one-to-one mapping between the elements of $S$ and the vertices of $G$, such that edges in $G$ exist if and only if the absolute difference of the corresponding vertex labels exist in $S$, then $G$ is an \emph{autograph}, and $S$ is a \emph{signature} for $G$. While it is known that many common families are graphs are autographs, and that infinitely many graphs are not autographs, a non-autograph has never been exhibited. In this paper, we identify the smallest non-autograph: a graph with 6 vertices and 11 edges. Furthermore, we demonstrate that the infinite family of graphs on $n$ vertices consisting of the complement of two non-intersecting cycles contains only non-autographs for $n \geq 8$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ben S. Baumer, Yijin Wei, Gary S. Bloom. 2015-11-12. We Found the Smallest Non-Autograph. https://arxiv.org/abs/1511.03913

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗