A Ramsey problem of Harary on graphs with prescribed size (Q1092061): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3907602 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4120601 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic lower bounds for Ramsey functions / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90173-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1994323471 / rank | |||
Normal rank |
Latest revision as of 09:45, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Ramsey problem of Harary on graphs with prescribed size |
scientific article |
Statements
A Ramsey problem of Harary on graphs with prescribed size (English)
0 references
1987
0 references
This paper contains several results relation the ``sizes'' of graphs and bounds on the corresponding Ramsey numbers. Two typical results: For any graph \(G\) with edges and no isolate vertices, \(r(K_3,G)\leq [8q/3]\). For a fixed graph \(G\) with \(p\) vertices (\(p\geq 3\)) and \(q\) edges, there exists a constant \(C\) such that for \(n\) sufficiently large, \(r(G,K_n)>C(n/\log(n))^{(p-1)(p-2)}\).
0 references
Ramsey numbers
0 references