Large generalized books are \(p\)-good (Q1880791): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0405140 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4398864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalizations of a Ramsey-theoretic result of chvátal / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On size Ramsey number of paths, trees, and circuits. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5724802 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3050459 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4878666 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3312262 / rank | |||
Normal rank |
Latest revision as of 12:01, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Large generalized books are \(p\)-good |
scientific article |
Statements
Large generalized books are \(p\)-good (English)
0 references
1 October 2004
0 references
A connected graph \(H\) is \(p\)-good if the Ramsey number \(r(K_p,H)\) is given by: \[ r(K_p,H)=(p-1)(| V(H)|-1)+1. \] This paper is devoted to proving that, for every \(p\geq 3\) and for \(q\) sufficiently large, the generalized book \(B_q^{(r)}= K_r+qK_1\) is \(p\)-good.
0 references
generalized book
0 references
Ramsey number
0 references
0 references