Explore >> Select a destination
|
You are here 
|
yufeizhao.com | ||
| | | | |
ptreview.sublinear.info
|
|
| | | | | ||
| | | | |
gowers.wordpress.com
|
|
| | | | | Here is a simple but important fact about bipartite graphs. Let $latex G$ be a bipartite graph with (finite) vertex sets $latex X$ and $latex Y$ and edge density $latex \alpha$ (meaning that the number of edges is $latex \alpha |X||Y|$). Now choose $latex (x_1,x_2)$ uniformly at random from $latex X^2$ and $latex (y_1,y_2)$ uniformly | |
| | | | |
www.jeremykun.com
|
|
| | | | | Graphs are among the most interesting and useful objects in mathematics. Any situation or idea that can be described by objects with connections is a graph, and one of the most prominent examples of a real-world graph that one can come up with is a social network. Recall, if you aren't already familiar with this blog's gentle introduction to graphs, that a graph $ G$ is defined by a set of vertices $ V$, and a set of edges $ E$, each of which connects two vertices. | |
| | | | |
ncatlab.org
|
|
| | | [AI summary] Mike Shulman, a Professor, discusses his academic work in homotopy type theory, higher inductive types, and related mathematical concepts through selected writings and talks. | ||
