The order of monochromatic subgraphs with a given minimum degree

Details The order of monochromatic subgraphs with a given minimum degree The order of monochromatic subgraphs with a given minimum degree

2002-12-30

arxiv.org/abs/math/0212373v1

Mathematics

Combinatorics

Scientific paper

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order at least $t$. For $n > k > d$ let $f(n,k,d)$ denote the minimum of $f_G(d)$ where $G$ ranges over all graphs with $n$ vertices and minimum degree at least $k$. In this paper we establish $f(n,k,d)$ whenever $k$ or $n-k$ are fixed, and $n$ is sufficiently large. We also consider the case where more than two colors are allowed.

Affiliated with

Also associated with

No associations

Rating

The order of monochromatic subgraphs with a given minimum degree 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 The order of monochromatic subgraphs with a given minimum degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The order of monochromatic subgraphs with a given minimum degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581174