Exact Values for Some Size Ramsey Numbers of Paths and Cycles
For the graphs G1, G2, and G, if every 2-coloring (red and blue) of the edges of G results in either a copy of blueG1 or a copy of redG2, we write G → (G1, G2). The size Ramsey number R^(G1,G2) is the smallest number e such that there is a graph G with size e satisfying G → (G1, G2), i.e., R^(G1,G2)...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Frontiers Media S.A.
2020-09-01
|
| Series: | Frontiers in Physics |
| Subjects: | |
| Online Access: | https://www.frontiersin.org/article/10.3389/fphy.2020.00350/full |