1984•Journal of Graph TheoryRequires access
The ramsey numbers for stripes and one complete graph
Peter Lorimer
Open publisher page 20 citations
Abstract
Abstract The Ramsey numbers r ( K p , n 1 P 2 ,…, n d P 2 ), p > 2, are calculated.
Peter Lorimer
Abstract
Abstract The Ramsey numbers r ( K p , n 1 P 2 ,…, n d P 2 ), p > 2, are calculated.
OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract The Ramsey numbers r ( K p , n 1 P 2 ,…, n d P 2 ), p > 2, are calculated.
Key concepts: Ramsey's theorem, Combinatorics, Mathematics, Graph, Discrete mathematics