Explore >> Select a destination
|
You are here 
|
yufeizhao.wordpress.com | ||
| | | | |
www.jeremykun.com
|
|
| | | | | Define the Ramsey number $ R(k,m)$ to be the minimum number $ n$ of vertices required of the complete graph $ K_n$ so that for any two-coloring (red, blue) of the edges of $ K_n$ one of two things will happen: There is a red $ k$-clique; that is, a complete subgraph of $ k$ vertices for which all edges are red. There is a blue $ m$-clique. It is known that these numbers are always finite, but it is very difficult to compute them exactly. | |
| | | | |
ptreview.sublinear.info
|
|
| | | | | ||
| | | | |
yufeizhao.com
|
|
| | | | | Ben Gunby's new paper determining the large deviation rate for sparse random regular graphs. | |
| | | | |
clutterreport.wordpress.com
|
|
| | | attempting to clean up my living and workspace | ||
