Analysis reveals Ramsey-type theorems in finite n-colorable and n-chromatic graphs, suggesting new insights.
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.
No takes yet. Share an insight, caveat, or question.
Lionel Nguyen Van Thé (2010) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: