While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to construct the colorings of the edges of complete split graphs avoiding rainbow 2-connected subgraphs. These colorings give the lower bounds for adequate anti-Ramsey numbers.
@article{bwmeta1.element.doi-10_1515_math-2017-0035,
author = {Izolda Gorgol},
title = {Avoiding rainbow 2-connected subgraphs},
journal = {Open Mathematics},
volume = {15},
year = {2017},
pages = {393-397},
zbl = {06715912},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2017-0035}
}
Izolda Gorgol. Avoiding rainbow 2-connected subgraphs. Open Mathematics, Tome 15 (2017) pp. 393-397. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2017-0035/