Edge-Colored Graphs: Ramsey and Folkman Numbers
摘要
In this chapter, we will see that no matter how edges of a complete graph Kn are colored in two or, more generally, finitely many colors (each edge in one color), we can guarantee the existence of the desired monochromatic subgraph as long as we choose n to be large enough.