Some Ramsey theorems for finite nn-colorable and nn-chromatic graphs

preprint2009arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.