Outer Web | Explore

Explore >> Select a destination

You are here		11011110.github.io Orthogonal polyhedra
\|	\|	www.jeremykun.com On Coloring Resilient Graphs \|\| Math ? Programming	13.1 parsecs away Travel
\|	\|	I'm pleased to announce that another paper of mine is finished. This one just got accepted to MFCS 2014, which is being held in Budapest this year (this whole research thing is exciting!). This is joint work with my advisor, Lev Reyzin. As with my first paper, I'd like to explain things here on my blog a bit more informally than a scholarly article allows. A Recent History of Graph Coloring One of the first important things you learn when you study graphs is that coloring graphs is hard.	13.1 parsecs away Travel
\|	\|	yufeizhao.wordpress.com Upper tails for triangles in sparse random graphs \| Yufei Zhao	16.2 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...	16.2 parsecs away Travel
\|	\|	corbettmaths.com Ultimate GCSE Foundation Maths Revision Video and Booklet	9.5 parsecs away Travel
\|	\|	The Ultimate GCSE Foundation Maths Revision Video and Booklet - Edexcel AQA OCR - Corbettmaths	9.5 parsecs away Travel
\|	\|	localtvwhnt.wordpress.com Wildlife Rehabbers Furious Over New State Guidelines Forbidding Rescue/Rehab of 7 Species \| Wolf Howls	66.7 parsecs away Travel
\|		Reblogged on WordPress.com	66.7 parsecs away Travel