Math ClubThe Random GraphReed Solomon (UConn)

Wednesday, March 6, 2019
5:45pm – 6:35pm

Storrs Campus
Monteith 321

An undirected graph consists of a set of vertices (represented as dots) with edges drawn between some of the vertices. One way to construct a "random" graph with $$n$$ vertices is to draw $$n$$ vertices and for each pair of distinct vertices, flip a coin to determine whether you draw an edge between them. This talk will be about what happens if you try this procedure with an infinite (countable) set of vertices. The answer will use a little bit of probability and a basic algebraic technique that shows up often in mathematical logic.

Contact: