Graphs omitting sums of complete graphs |
| |
Authors: | Gregory Cherlin Niandong Shi |
| |
Abstract: | For every finite m and n there is a finite set {G1, …, Gl} of countable (m · Kn)-free graphs such that every countable (m · Kn)-free graph occurs as an induced subgraph of one of the graphs Gl © 1997 John Wiley & Sons, Inc. |
| |
Keywords: | |
|
|