Graphs isomorphisms under edge-replacements and the family of amoebas (Q6133145)

Summary: This paper offers a systematic study of a family of graphs called amoebas. Amoebas recently emerged from the study of forced patterns in \(2\)-colorings of the edges of the complete graph in the context of Ramsey-Turan theory and played an important role in extremal zero-sum problems. Amoebas are graphs defined by means of the following operation: Let \(G\) be a graph and let \(e\in E(G)\) and \(e^\prime\in E(\overline{G})\). If the graph \(G^\prime=G-e+e^\prime\) is isomorphic to \(G\), we say \(G^\prime\) is obtained from \(G\) by performing \textit{a feasible edge-replacement}. We call \(G\) a local amoeba if, for any two copies \(G_1, G_2\) of \(G\) on the same vertex set, \(G_1\) can be transformed into \(G_2\) by a chain of feasible edge-replacements. On the other hand, \(G\) is called global amoeba if there is an integer \(t_0 \geqslant 0\) such that \(G \cup t K_1\) is a local amoeba for all \(t \geqslant t_0\). To model the dynamics of the feasible edge-replacements of \(G\), we define a group \(\mathrm{Fer}(G)\) that satisfies that \(G\) is a local amoeba if and only if \(\mathrm{Fer}(G) \cong S_n\), where \(n\) is the order of \(G\). Via this algebraic setting, a deeper understanding of the structure of amoebas and their intrinsic properties comes into light. Moreover, we present different constructions that prove the richness of these graph families showing, among other things, that any connected graph can be a connected component of a global amoeba, that global amoebas can be very dense and that they can have, in proportion to their order, large clique and chromatic numbers. Also, a family of global amoeba trees with a Fibonacci-like structure and with arbitrary large maximum degree is constructed.