Saved in:
Bibliographic Details
Main Authors: Eddy, Jillian, Pesak, Ryan, Qin, Daniel, Ventura, Denae
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.15086
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915559231193088
author Eddy, Jillian
Pesak, Ryan
Qin, Daniel
Ventura, Denae
author_facet Eddy, Jillian
Pesak, Ryan
Qin, Daniel
Ventura, Denae
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2510_15086
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Stem-Symmetry, Comb Products, and their Relation to Amoeba Graphs
Eddy, Jillian
Pesak, Ryan
Qin, Daniel
Ventura, Denae
Combinatorics
05C25
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.
title Stem-Symmetry, Comb Products, and their Relation to Amoeba Graphs
topic Combinatorics
05C25
url https://arxiv.org/abs/2510.15086