• DOI:10.1007/PL00021189
• Corpus ID: 5601953

Finding Large p-Colored Diameter Two Subgraphs

@article{Erds1999FindingLP,
  title={Finding Large p-Colored Diameter Two Subgraphs},
  author={Paul Erd{\"o}s and Tom Fowler},
  journal={Graphs and Combinatorics},
  year={1999},
  volume={15},
  pages={21-27}
}

• P. Erdös, Tom Fowler
• Published 1 March 1999
• Mathematics
• Graphs and Combinatorics

Abstract. Given a coloring of the edges of the complete graph K 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 vertices and that this is best possible up to an additive constant l satisfying 0≤l