Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers (Q1567606): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q323047 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Jack E. Graver / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(99)00399-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2067803318 / rank | |||
Normal rank |
Latest revision as of 11:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers |
scientific article |
Statements
Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers (English)
0 references
29 January 2001
0 references
The authors define a variation on the usual Ramsey numbers: \(R_c(P^{\text{conv}}_e,t)\) is defined as the smallest integer \(n\) so that, if the vertices of the complete graph are cyclically ordered and its edges are \(t\)-colored, there exists a monochromatic path of length \(l\) which respects the order. \(R_c(C^{\text{conv}}_k, C_e^{\text{conv}})\) is similarly defined where \(C^{\text{conv}}_e\) refers to circuits for length \(l\) which respect the ordering. The authors prove several results including: Theorem 2.2. For positive integers \(l\) and \(t\), \(1+ l(l- 1)^{t-1}\leq R_c(P^{\text{conv}}_l,t)\leq 1+l^t\). Theorem 3.3. For positive integers \(l\) and \(k\), \[ (k-1)(l- 1)+ 1\leq R_c(C^{\text{conv}}_k, C^{\text{conv}}_l)\leq 2kl- 3k- 3l+ 6. \]
0 references
Ramsey numbers
0 references
complete graph
0 references