Explore >> Select a destination
|
You are here 
|
extremal010101.wordpress.com | ||
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... | |
| | | | |
alanrendall.wordpress.com
|
|
| | | | | The theorem of the title is about dividing smooth functions by other smooth functions or, in other words, representing a given smooth function in terms of products of other smooth functions. A large part of the account which follows is based on that in the book 'Normal Forms and Unfoldings for Local Dynamical Systems' by... | |
| | | | |
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$... | |
| | | | |
chava61photography.photo.blog
|
|
| | | Visit the post for more. | ||
