The Ramsey number of an \(n\)-edge graph versus triangle is at most \(2n+1\) (Q1325260): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
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.1006/jctb.1993.1036 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2077788572 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:14, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Ramsey number of an \(n\)-edge graph versus triangle is at most \(2n+1\) |
scientific article |
Statements
The Ramsey number of an \(n\)-edge graph versus triangle is at most \(2n+1\) (English)
0 references
15 June 1994
0 references
The Ramsey number \(r(H,G)\) is defined as the minimal \(N\) such that for any coloring of the edges of the \(N\)-vertex complete graph \(K_ N\) in red and blue, it must contain either a red \(H\) or a blue \(G\). We prove the conjecture of Harary that for any graph \(G\) with \(n\) edges and without isolated vertices, \(r(K_ 3,G)\leq 2n+1\).
0 references
triangle
0 references
Ramsey number
0 references
conjecture of Harary
0 references