Explore >> Select a destination
|
You are here 
|
jeremykun.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. | |
| | | | |
swethatanamala.github.io
|
|
| | | | | As a series of posts, I would be working and explaining on deep graph neural networks. So, In this blog I give introduction to Graph theory | |
| | | | |
yufeizhao.wordpress.com
|
|
| | | | | Eyal Lubetzky and I just finished and uploaded to the arXiv our new paper On the variational problem for upper tails of triangle counts in sparse random graphs. This paper concerns the following question: The upper tail problem for triangles. What is the probability that the number of triangles in an Erd?s-Rényi graph graph $latex... | |
| | | | |
77wolfhowls.wordpress.com
|
|
| | | Metal Detectors In Movie Theaters. | ||
