Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		11011110.github.io Planarizing matchings
\|	\|	gilkalai.wordpress.com Micha Perles' Geometric Proof of the Erdos-Sos Conjecture for Caterpillars \| Combinatorics and more	4.6 parsecs away Travel
\|	\|	A geometric graph is a set of points in the plane (vertices) and a set of line segments between certain pairs of points (edges). A geometric graph is simple if the intersection of two edges is empty or a vertex of both. A geometric graph is convex if the vertices are in convex position. A...	4.6 parsecs away Travel
\|	\|	yufeizhao.com The number of independent sets in an irregular graph	5.6 parsecs away Travel
\|	\|	Resolution of Kahn's conjecture on the maximum number of independent sets in a graph with prescribed degree-degree distributions.	5.6 parsecs away Travel
\|	\|	yufeizhao.wordpress.com Extremal regular graphs \| Yufei Zhao	4.5 parsecs away Travel
\|	\|	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...	4.5 parsecs away Travel
\|	\|	chava61photography.photo.blog Pull Up a Seat Photo Challenge 2020: #26 - This and That: The Continuation	24.2 parsecs away Travel
\|		Visit the post for more.	24.2 parsecs away Travel