Avoiding rainbow 2-connected subgraphs
Open Mathematics (2017)
- Volume: 15, Issue: 1, page 393-397
- ISSN: 2391-5455
Access Full Article
top
Abstract
topHow to cite
topIzolda Gorgol. "Avoiding rainbow 2-connected subgraphs." Open Mathematics 15.1 (2017): 393-397. <http://eudml.org/doc/288128>.
@article{IzoldaGorgol2017,
abstract = {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.},
author = {Izolda Gorgol},
journal = {Open Mathematics},
keywords = {Extremal edge-colorings; Anti-Ramsey number; extremal edge-colorings; anti-Ramsey number},
language = {eng},
number = {1},
pages = {393-397},
title = {Avoiding rainbow 2-connected subgraphs},
url = {http://eudml.org/doc/288128},
volume = {15},
year = {2017},
}
TY - JOUR
AU - Izolda Gorgol
TI - Avoiding rainbow 2-connected subgraphs
JO - Open Mathematics
PY - 2017
VL - 15
IS - 1
SP - 393
EP - 397
AB - 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.
LA - eng
KW - Extremal edge-colorings; Anti-Ramsey number; extremal edge-colorings; anti-Ramsey number
UR - http://eudml.org/doc/288128
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.