Exactly Colored Complete Subgraphs of Infinite Graphs — Quantapedia

Given integers $m\le c$ and an exact $c$-coloring of the edges of a complete countably infinite graph (i.e. a coloring that uses exactly $c$ colors), must there be an infinite subgraph that is exactly

Powered by Quantum Pulse Intelligence