Ramsey sequences of graphs
A sequence of graphs is a Ramsey sequence if for every positive integer k, the graph Gk is isomorphic to a proper subgraph of and for each positive integer k, there is an integer such that every red-blue coloring of Gn results in a monochromatic Gk. Some sequences of graphs that are Ramsey sequences...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-10-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09728600.2020.1832872 |