| Irredundant and Mixed Ramsey Numbers |
2013 |
690045 |
The irredundant Ramsey number s(m n) is the smallest p such that in every two-coloring of the edges of K[subscript]p using colors red (R) and blue (B) either the blue subgraph contains an m-element irredundant set or the red subgraph contains an n-el... |