A generalization of Ramsey theory for stars and one matching

Details A generalization of Ramsey theory for stars and one matching A generalization of Ramsey theory for stars and one matching

2012-03-11

arxiv.org/abs/1203.2339v1

Mathematics

Combinatorics

7 pages, 1 figure

Scientific paper

A recent question in generalized Ramsey theory is that for fixed positive integers $s\leq t$, at least how many vertices can be covered by the vertices of no more than $s$ monochromatic members of the family $\cal F$ in every edge coloring of $K_n$ with $t$ colors. This is related to {{$d$-chromatic Ramsey numbers}} introduced by Chung and Liu. In this paper, we first compute these numbers for stars generalizing the well-known result of Burr and Roberts. Then we extend a result of Cockayne and Lorimer to compute $d$-chromatic Ramsey numbers for stars and one matching.

Affiliated with

Also associated with

No associations

Rating

A generalization of Ramsey theory for stars and one matching 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 A generalization of Ramsey theory for stars and one matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A generalization of Ramsey theory for stars and one matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14605