Global amoebas are a wide and rich family of graphs that emerged from the study certain Ramsey-Turán problems in 2-colorings edges complete graph Kn deal with appearance unavoidable patterns once amount each color is guaranteed. Indeed, it turns out that, as soon such coloring constraints satisfied if n sufficiently large, then every global amoeba can be found embedded has half its color. Even ...