Singular Ramsey and Turán numbers
We say that a subgraph F of a graph G is singular if the degrees d_G(v) are all equal or all distinct for the vertices v of F. The singular Ramsey number Rs(F) is the smallest positive integer n such that, for every m at least n, in every edge 2-coloring of K_m, at least one of the color classes con...
| Published in: | Theory and Applications of Graphs |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2019-02-01
|
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/cgi/cview.cgi/tag/vol6/iss1/1 |