Explore >> Select a destination
|
You are here 
|
swethatanamala.github.io | ||
| | | | |
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. | |
| | | | |
jeremykun.wordpress.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$... | |
| | | | |
11011110.github.io
|
|
| | | | | Three quick puzzles concerning the polycube depicted below: (1) Cut it into two pieces that can be reassembled into a cube. (2) Fill space with translated, r... | |
| | | | |
dsyme.home.blog
|
|
| | | This is an archive of https://blogs.msdn.com/dsyme, my old blog | ||
