Recursive constructions of amoebas
Adriana Hansberg, Amanda Montejano, Yair Caro

TL;DR
This paper explores recursive methods to construct amoebas, a class of graphs relevant in Ramsey-Turán problems, revealing their structural properties and embedding behaviors in complete graphs.
Contribution
It introduces three recursive constructions of amoebas, expanding understanding of their structure and embedding capabilities in large complete graphs.
Findings
Global amoebas are unavoidable in large complete graphs under certain colorings.
Bipartite global amoebas are unavoidable in all tonal variations.
Three recursive constructions demonstrate the versatility and richness of amoebas.
Abstract
Global amoebas are a wide and rich family of graphs that emerged from the study of certain Ramsey-Tur\'an problems in -colorings of the edges of the complete graph that deal with the appearance of unavoidable patterns once a certain amount of edges in each color is guaranteed. Indeed, it turns out that, as soon as such coloring constraints are satisfied and if is sufficiently large, then every global amoeba can be found embedded in such that it has half its edges in each color. Even more surprising, every bipartite global amoeba is unavoidable in every tonal-variation, meaning that, for any pair of integers such that is the number of edges of , there is a subgraph of isomorphic to with edges in the first color and edges in the second. The feature that makes global amoebas work are one-by-one edge replacements that leave the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
