Edge colorings of graphs without monochromatic stars
2020
Abstract
In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph on n vertices may admit. Our results rely on an improved application of an entropy inequality of Shearer. (c) 2020 Elsevier B.V. All rights reserved.
Details
Title
Edge colorings of graphs without monochromatic stars
Author(s)
Colucci, Lucas ; Gyori, Ervin ; Methuku, Abhishek
Published in
Discrete Mathematics
Volume
343
Issue
12
Pages
112140
Date
2020-12-01
Publisher
Amsterdam, ELSEVIER
ISSN
0012-365X
1872-681X
1872-681X
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
DCG
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2020-11-01