Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
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$... | |
| | | | |
teachingintrotocs.blogspot.com
|
|
| | | | | I just saw a talk by Thomas Sauerwald analyzing the push-pull protocol for broadcasting in graph-theoretical models for social networks. If ... | |
| | | | |
blog.evjang.com
|
|
| | | | | You can find a PDF version of this blog post here . A weighted graph is a data structure consisting of some vertices and edges, and each... | |
| | | | |
preprints.jmir.org
|
|
| | | Journal of Medical Internet Research - International Scientific Journal for Medical Research, Information and Communication on the Internet | ||
