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

TL;DR

This paper establishes Ramsey-type theorems for various classes of finite graphs characterized by their colorability and chromatic number, including ordered and unordered cases.

Contribution

It introduces new Ramsey theorems specifically for finite ordered and unordered n-colorable and n-chromatic graphs, expanding the understanding of their combinatorial properties.

Findings

Proves Ramsey theorems for finite ordered n-colorable graphs

Establishes Ramsey results for finite n-chromatic graphs

Extends classical Ramsey theory to new graph classes

Abstract

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.