Skip To Main Content
Vigleik Angeltveit on Muck Rack

Vigleik Angeltveit

As seen in: Wiley Online Library
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Vigleik

Contact Vigleik, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

R ( 5 , 5 ) ≤ 46 $R(5,5)\le 46$

|
By Brendan McKay, Vigleik Angeltveit
| Wiley Online Library Verified
V.Angeltveit, and B. D.McKay, “R(5,5)≤46 $R(5,5)\le 46$,” Journal of Graph Theory0 (2026): 0–0. https://doi.org/10.1002/jgt.70029. 1 Introduction The Ramsey number R ( s , t ) $R(s,t)$ is defined to be the smallest n $n$ such that every graph of order n $n$ contains either a clique of s $s$ vertices or an independent set of t $t$ vertices. See [1] for a survey on the currently known bounds for small Ramsey numbers. Theorem 1.1.The Ramsey number R ( 5 , 5 ) $R(5,5)$ is less than or equal to 46.
Open in Who Shared Issue with article?
See all 1 articles