/explore
|
You are here 
|
gilkalai.wordpress.com | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
polymathprojects.org
This post is meant to propose and discuss a polymath project and a sort of polymath project. I. A polymath proposal: Convex hulls of real algebraic varieties. One of the interesting questions regarding the polymath endeavor was: Can polymath be used to develop a theory/new area? My idea is to have a project devoted to... |
|
| | | | | ||
| | | | |
dominiczypen.wordpress.com
Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$... |
|
| | | | | ||
| | | | |
rapuran.wordpress.com
More on Weekly Travel Theme |
|
| | | |||
