Finding large p-colored diameter two subgraphs

P. Erdős, Tom Fowler

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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 <k/2.

Original languageEnglish
Pages (from-to)21-27
Number of pages7
JournalGraphs and Combinatorics
Volume15
Issue number1
Publication statusPublished - 1999

Fingerprint

Subgraph
Color
Coloring
Complete Graph
Colouring

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

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

In: Graphs and Combinatorics, Vol. 15, No. 1, 1999, p. 21-27.

Research output: Contribution to journalArticle

Erdős, P. ; Fowler, Tom. / Finding large p-colored diameter two subgraphs. In: Graphs and Combinatorics. 1999 ; Vol. 15, No. 1. pp. 21-27.
@article{136e03718f45432189c02ab72aed247a,
title = "Finding large p-colored diameter two subgraphs",
abstract = "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",
author = "P. Erdős and Tom Fowler",
year = "1999",
language = "English",
volume = "15",
pages = "21--27",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

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 -