The theta-complete graph Ramsey number \(R(\theta_n,K_5)=4n-3\) for \(n=6\) and \(n\geq 10\). (Q3134353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 6837016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The theta-complete graph Ramsey number \(R(\theta_n,K_5)=4n-3\) for \(n=6\) and \(n\geq 10\). |
scientific article; zbMATH DE number 6837016 |
Statements
9 February 2018
0 references
Ramsey number
0 references
independent set
0 references
theta graph
0 references
complete graph
0 references
0.9141190648078918
0 references
0.908182680606842
0 references
0.9002996683120728
0 references
0.8351224660873413
0 references
0.8325627446174622
0 references
