On ramsey numbers for books
Authors:
- 1 March 1978
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 2 (1) , 77-87
Abstract
For n = 1, 2, …, let Bn = K2 + K̄n. We pose the problem of determining the Ramsey numbers r(Bm, Bn) and demonstrate that in many cases critical colorings are avialable from known examples of strongly regular graphs.Keywords
This publication has 8 references indexed in Scilit:
- Graph Theory, Coding Theory and Block Designs1975
- Strongly regular graphsDiscrete Mathematics, 1975
- Generalized ramsey theory for graphs - a survey1974
- Strongly Regular Graphs Derived from Combinatorial DesignsCanadian Journal of Mathematics, 1970
- GRAPH THEORY1969
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963
- On Sets of Acquaintances and Strangers at any PartyThe American Mathematical Monthly, 1959
- On Sets of Acquaintances and Strangers at any PartyThe American Mathematical Monthly, 1959