Outer Web | Explore

Explore >> Select a destination

You are here		www.jeremykun.com Ramsey Number Lower Bound \|\| Math ? Programming
\|	\|	xenaproject.wordpress.com Formalising modern research mathematics in real time \| Xena	16.2 parsecs away Travel
\|	\|	(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...	16.2 parsecs away Travel
\|	\|	jeremykun.wordpress.com Ramsey Number Lower Bound - Math ? Programming	1.1 parsecs away Travel
\|	\|	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$...	1.1 parsecs away Travel
\|	\|	yufeizhao.wordpress.com Upper tails for triangles in sparse random graphs \| Yufei Zhao	8.6 parsecs away Travel
\|	\|	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...	8.6 parsecs away Travel
\|	\|	cuoichutdi.wordpress.com Chân lý ?n d?u hay trùng h?p tình c?? \| Blog Toán H?c	67.5 parsecs away Travel
\|		Liverpool v?a vô ??ch Premier League, ?i?u này t?o nên m?t th?ng kê thú v?: s? cúp vô ??ch c?a các ??i bóng t?o thành m?t dãy s? Fibonacci. ?i?u này là ng?u nhiên hay có m?t cách lí gi?i toán h?c ?n sau nó? Tôi biên bài báo ng?n v? dãy Fibonacci c?ng nh?...	67.5 parsecs away Travel