Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.19023

On $(k,g)$-Graphs without $(g+1)$-Cycles

Leonard Chidiebere Eze·Robert Jajcay·Jorik Jooken
View original source ↗Read source document ↗Export metadata ↓

Abstract

A $(k,g,\underline{g+1})$-graph is a $k$-regular graph of girth $g$ which does not contain cycles of length $g+1$. Such graphs are known to exist for all parameter pairs $k \geq 3, g \geq 3 $, and we focus on determining the orders $n(k,g,\underline{g+1})$ of the smallest $(k,g,\underline{g+1})$-graphs. This problem can be viewed as a special case of the previously studied Girth Pair Problem, the problem of finding the order of a smallest $k$-regular graph in which the length of a smallest even length cycle and the length of a smallest odd length cycle are prescribed. When considering the case of an odd girth $g$, this problem also yields results towards the Cage Problem, the problem of finding the order of a smallest $k$-regular graph of girth $g$. We establish the monotonicity of the function $n(k,g,\underline{g+1})$ with respect to increasing $g$, and present universal lower bounds for the values $n(k,g,\underline{g+1})$. We propose an algorithm for generating all $(k,g,\underline{g+1})$-graphs on $n$ vertices, use this algorithm to determine several of the smaller values $n(k,g,\underline{g+1})$, and discuss various approaches to finding smallest $(k,g,\underline{g+1})$-graphs within several classes of highly symmetrical graphs.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken. 2025-07-30. On $(k,g)$-Graphs without $(g+1)$-Cycles. https://doi.org/10.1016/j.amc.2025.129645

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗