Journal of Graph Theory · 1978 · 62 citations · 6 references
Ramsey NumbersGraph TheoryExtremal Graph TheoryStructural Graph TheoryAlgebraic Graph TheoryCombinatorial Design TheoryExtremal CombinatoricsEnumerative CombinatoricsDiscrete MathematicsCombinatorial OptimizationB NRegular Graphs
Abstract For n = 1, 2, …, let B n = K 2 + K̄ n . We pose the problem of determining the Ramsey numbers r( B m , B n ) and demonstrate that in many cases critical colorings are avialable from known examples of strongly regular graphs .
6
Xavier Hubaut · Discrete Mathematics · 1975 · 247 citations
Graph Theory, Algebraic Graph Theory, Topological Graph Theory +3