Search arXivSearch

arXiv · 2510.15086

Stem-Symmetry, Comb Products, and their Relation to Amoeba Graphs

Abstract

Local and global amoebas are families of labeled graphs that satisfy interpolation properties on a fixed vertex set. A labeled graph $G$ on $n$ vertices is a local amoeba (resp. global amoeba) if there exists a sequence of feasible edge-replacements between any two labelled embeddings of $G$ into $K_n$ (resp. $K_{n+1}$). Here, a feasible edge-replacement removes an edge and reinserts it so that the resulting graph is isomorphic to $G$; the induced relabeling yields a class of permutations of the label set. Motivated by classical group theoretic ideas, we introduce the hang group, a new invariant that can encode how local amoebas embed into larger ones. Using this framework, we identify necessary and sufficient conditions connecting stem-symmetric and hang-symmetric graphs with local and global amoebas. In particular, we show how hang-symmetry and stem-symmetry conditions propagate under the addition of leaves and isolated vertices, in turn yielding constructive criteria for both local and global amoebas. Finally, via wreath products, we provide four sets of sufficient conditions, one for each property, guaranteeing when the comb product is a local amoeba, a global amoeba, stem-symmetric, or hang-symmetric. These results strengthen and generalize existing constructions of local and global amoebas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jillian Eddy, Ryan Pesak, Daniel Qin, Denae Ventura. 2025-10-16. Stem-Symmetry, Comb Products, and their Relation to Amoeba Graphs. https://arxiv.org/abs/2510.15086

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