/explore
|
You are here 
|
yufeizhao.wordpress.com | ||
| | | | |
yufeizhao.com
Ben Gunby's new paper determining the large deviation rate for sparse random regular graphs. |
|
| | | | | ||
| | | | |
anuragbishnoi.wordpress.com
The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge... |
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
runswiththedug.wordpress.com
Visit the post for more. |
|
| | | |||
