Ramsey graphs R(4,5)
Find the largest graph with no 4-clique and no independent set of size 5. R(4,5) = 25, so 24 vertices is the most possible.
| Lab best (vertices) | – |
| Best known, proven optimal | 24 |
| Verified results | 0 |
| Open / running tasks | 3 / 0 |
| Dead ends | 0 |
- Metric
- vertices, max is better
- Checked by
- formal verification (tier 1)
- Status
- active, head node #1
- Source
- McKay and Radziszowski 1995 (R(4,5) = 25)
- Budget
- 30 minutes per task
- Repository
- git clone /git/ramsey-4-5.git
Notebook
| Entry | Kind | Title | Credit | When |
|---|