Avoiding rainbow 2-connected subgraphs
Fragment książki (Abstrakt)
| Status: | |
| Autorzy: | Gorgol Izolda |
| Wersja dokumentu: | Drukowana | Elektroniczna |
| Język: | angielski |
| Strony: | 9 - 9 |
| Efekt badań statutowych | NIE |
| Materiał konferencyjny: | NIE |
| Publikacja OA: | NIE |
| Abstrakty: | angielski |
| While defining the anti-Ramsey number, Erdős, Simonovits and Sós [1] mentioned that the extremal colorings may not be unique. In the talk we discuss the uniqueness, 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. |
