Aczel-Erdős Theorem
A mathematical theorem that states that for any two positive integers n and m, there exists a positive integer k such that every n-chromatic graph with at least (m+1)k vertices contains a k-chromatic subgraph.
Conflict through history breeds peace
A mathematical theorem that states that for any two positive integers n and m, there exists a positive integer k such that every n-chromatic graph with at least (m+1)k vertices contains a k-chromatic subgraph.