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

Authors

  • Lionel Nguyen Van Thé

DOI:

https://doi.org/10.11575/cdm.v5i2.62045

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.

Downloads

Published

2010-09-28

Issue

Section

Articles