Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.07939

Dimension and Order Bounds for Isometric Embeddings of Graphs into Abelian Cayley Graphs, and the Abelian Dividend

Fokam Souop Rigobert·Bitjoka Laurent
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the minimum size of finite abelian Cayley graphs that admit an isometric embedding of a finite connected graph. While every connected graph on n vertices embeds isometrically into a binary Cayley graph of dimension at most n-1, the smallest possible abelian host has remained largely unexplored. We establish fundamental lower bounds showing that every binary host has dimension at least max(diam(G), floor(log2 n)), whereas every finite abelian host has order at least max(n, 2^diam(G)). Moreover, we prove that the minimum host order equals n if and only if G is itself an abelian Cayley graph. Exact binary dimensions are obtained for several important graph families. Hypercubes, complete graphs of order 2^k, and even cycles attain the lower bound. For stars we prove k_min(K1,q)=floor(log2 q)+1 using maximum sum-free sets, yielding an exponential improvement over the naive and isometric dimensions. For odd cycles we prove k_min(Cm)=m-1 for all m<17 and reduce the general case to a cyclic-interval lemma, showing that the universal upper bound is tight. Our computational contribution is a certified exhaustive census of all 995 connected graphs with 2<=n<=7 vertices under general abelian compactifications. The data reveal an "abelian dividend": 569 graphs (57 percent) admit a strictly smaller abelian host than the best binary host, 707 (71 percent) admit an optimal host containing a cyclic factor Zm with m>2, and only 17 graphs attain the theoretical order floor max(n,2^diam(G)). These results demonstrate that compact non-binary abelian hosts are typical rather than exceptional, while binary hosts remain the universal worst-case construction. 2020 MSC:05C12, 05C25, 05C30, 11B75, 20K01

Explore related subjects

math.CO

Keep this discovery

BibTeXRIS

Fokam Souop Rigobert, Bitjoka Laurent. 2026-07-08. Dimension and Order Bounds for Isometric Embeddings of Graphs into Abelian Cayley Graphs, and the Abelian Dividend. https://arxiv.org/abs/2607.07939

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

KEEP EXPLORING

Related papers

arXiv2026

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO↗
arXiv2026

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO↗
arXiv2026

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO↗