Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs
Combinatorics
2014-01-07 v1 Logic
Abstract
Given a fixed integer , we prove Ramsey-type theorems for the classes of all finite ordered -colorable graphs, finite -colorable graphs, finite ordered -chromatic graphs, and finite -chromatic graphs.
Cite
@article{arxiv.0908.0475,
title = {Some Ramsey theorems for finite $n$-colorable and $n$-chromatic graphs},
author = {L. Nguyen Van Thé},
journal= {arXiv preprint arXiv:0908.0475},
year = {2014}
}
Comments
7 pages