/explore
|
You are here 
|
jeremykun.wordpress.com | ||
| | | | |
xenaproject.wordpress.com
|
|
| | | | | (This is a guest post by Bhavik Mehta) On March 16, 2023, a paper by Campos, Griffiths, Morris, and Sahasrabudhe appeared on the arXiv, announcing an exponential improvement to the upper bound on Ramsey numbers, an open problem since 1935. Around the same time, posts by Terence Tao, Timothy Gowers and Gil Kalai appeared, all... | |
| | | | |
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... | |
| | | | |
yufeizhao.wordpress.com
|
|
| | | | | This post is adapted from my new expository survey Extremal regular graphs: independent sets and graph homomorphisms. The earliest result in extremal graph theory is usually credited to Mantel, who proved, in 1907, that a graph on $latex {n}$ vertices with no triangles contains at most $latex {n^2/4}$ edges, where the maximum is achieved for... | |
| | | | |
qchu.wordpress.com
|
|
| | | Let $latex k$ be a commutative ring. A popular thing to do on this blog is to think about the Morita 2-category $latex \text{Mor}(k)$ of algebras, bimodules, and bimodule homomorphisms over $latex k$, but it might be unclear exactly what we're doing when we do this. What are we studying when we study the Morita... | ||
