Finding Large Monochromatic Diameter Two Subgraphs

Details Finding Large Monochromatic Diameter Two Subgraphs Finding Large Monochromatic Diameter Two Subgraphs

1999-08-30

arxiv.org/abs/math/9908170v1

Mathematics

Combinatorics

20 pages

Scientific paper

Given a coloring of the edges of the complete graph on n vertices in k colors, by considering the neighbors of an arbitrary vertex it follows that there is a monochromatic diameter two subgraph on at least 1+(n-1)/k vertices. We show that for $k \ge 3$ this is asymptotically best possible, and that for k=2 there is always a monochromatic diameter two subgraph on at least $\lceil {3 \over 4} n \rceil$ vertices, which again, is best possible.

Affiliated with

Also associated with

No associations

Rating

Finding Large Monochromatic Diameter Two Subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding Large Monochromatic Diameter Two Subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Large Monochromatic Diameter Two Subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499427