Previous Page 37

Displaying 721 – 724 of 724

Showing per page

Avoiding rainbow 2-connected subgraphs

Izolda Gorgol (2017)

Open Mathematics

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.

Currently displaying 721 – 724 of 724

Previous Page 37