Structure of colored complete graphs free of proper cycles (Q1953342)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Structure of colored complete graphs free of proper cycles |
scientific article; zbMATH DE number 6171816
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Structure of colored complete graphs free of proper cycles |
scientific article; zbMATH DE number 6171816 |
Statements
Structure of colored complete graphs free of proper cycles (English)
0 references
7 June 2013
0 references
Summary: For a fixed integer \(m\), we consider edge colorings of complete graphs which contain no properly edge colored cycle \(C_{m}\) as a subgraph. Within colorings free of these subgraphs, we establish global structure by bounding the number of colors that can induce a spanning and connected subgraph. In the case of smaller cycles, namely \(C_4,C_5\), and \(C_6\), we show that our bounds are sharp.
0 references
proper coloring
0 references
forbidden subgraph
0 references
monochromatic subgraph
0 references
