### Abstract

Given a coloring of the edges of the complete graph K_{n} on n vertices in k colors, a p-colored subgraph of K_{n} is any subgraph whose edges only use colors from some p element set. We show for k ≥ 1 and k/2 ≤ p ≤ k that there is always a p-colored diameter two subgraph of K_{n} containing at least (k + p)n/2k vertices and that this is best possible up to an additive constant l satisfying 0 ≤ l <k/2.

Original language | English |
---|---|

Pages (from-to) | 21-27 |

Number of pages | 7 |

Journal | Graphs and Combinatorics |

Volume | 15 |

Issue number | 1 |

Publication status | Published - 1999 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)
- Discrete Mathematics and Combinatorics

### Cite this

*Graphs and Combinatorics*,

*15*(1), 21-27.

**Finding large p-colored diameter two subgraphs.** / Erdős, P.; Fowler, Tom.

Research output: Contribution to journal › Article

*Graphs and Combinatorics*, vol. 15, no. 1, pp. 21-27.

}

TY - JOUR

T1 - Finding large p-colored diameter two subgraphs

AU - Erdős, P.

AU - Fowler, Tom

PY - 1999

Y1 - 1999

N2 - Given a coloring of the edges of the complete graph Kn on n vertices in k colors, a p-colored subgraph of Kn is any subgraph whose edges only use colors from some p element set. We show for k ≥ 1 and k/2 ≤ p ≤ k that there is always a p-colored diameter two subgraph of Kn containing at least (k + p)n/2k vertices and that this is best possible up to an additive constant l satisfying 0 ≤ l

AB - Given a coloring of the edges of the complete graph Kn on n vertices in k colors, a p-colored subgraph of Kn is any subgraph whose edges only use colors from some p element set. We show for k ≥ 1 and k/2 ≤ p ≤ k that there is always a p-colored diameter two subgraph of Kn containing at least (k + p)n/2k vertices and that this is best possible up to an additive constant l satisfying 0 ≤ l

UR - http://www.scopus.com/inward/record.url?scp=19544380050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=19544380050&partnerID=8YFLogxK

M3 - Article

VL - 15

SP - 21

EP - 27

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -