/explore
|
You are here 
|
mikespivey.wordpress.com | ||
| | | | |
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$... |
|
| | | | | ||
| | | | |
fabricebaudoin.blog
Exercise 1.Solve Exercise 44 in Chapter 1 of the book. Exercise 2.Solve Exercise 3 in Chapter 1 of the book. Exercise 3.Solve Exercise 39 in Chapter 1 of the book. Exercise 4.The heat kernel on $latex \mathbb{S}^1$ is given by $latex p(t,y) =\frac{1}{2\pi}\sum_{m \in \mathbb{Z}} e^{-m^2 t} e^{im y} =\frac{1}{\sqrt{4\pi t}} \sum_{k \in \mathbb{Z}} e^{-\frac{(y... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
greatmusclemasstips.wordpress.com
This is your very first post. Click the Edit link to modify or delete it, or start a new post. If you like, use this post to tell readers why you started this blog and what you plan to do with it. Happy blogging! |
|
| | | |||
