Monochromatic Connectivity in Monochromatic-Star-Free Graphs

Document Type

Article

Publication Date

11-2016

Publication Title

Journal of Combinatorial Mathematics and Combinatorial Computing

ISSN

0835-3026

Abstract

We consider edge-colorings of complete graphs in which each color induces a subgraph that does not contain an induced copy of K1,t for some t > 3. It turns out that such colorings, if the underlying graph is sufficiently large, contain spanning monochromatic κ-connected subgraphs. Furthermore, there exists a color, say blue, such that every vertex has very few incident edges in colors other than blue.

Link to Full Text

Share

COinS