Skip to main content
Article
Monochromatic Connectivity in Monochromatic-Star-Free Graphs
Journal of Combinatorial Mathematics and Combinatorial Computing
  • Colton Magnant, Georgia Southern University
  • Pouria Salehi Nowbandegani, Vanderbilt University
Document Type
Article
Publication Date
11-1-2016
Disciplines
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.

Citation Information
Colton Magnant and Pouria Salehi Nowbandegani. "Monochromatic Connectivity in Monochromatic-Star-Free Graphs" Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 99 (2016) p. 89 - 96 ISSN: 0835-3026
Available at: http://works.bepress.com/colton_magnant/55/