Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs

Details Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs

2009-08-04

arxiv.org/abs/0908.0475v1

Mathematics

Combinatorics

7 pages

Scientific paper

Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of
all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite
ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.

Affiliated with

Also associated with

No associations

Rating

Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs 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 Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557315