Department of Mathematics and Computer Science

An important characteristic of any network, consisting of nodes and their connections, is its reliability. The reliability of a network can be measured in many ways depending upon the type of network being examined. In communications networks, for example, the connections (rather than the nodes) are often subject to failure. One way to measure the reliability in this case is the component order edge connectivity of a graph which is the smallest number of edges that must be deleted in order to induce a subgraph which has all components less than some predetermined size. What we can look at then are ways in which we can construct the most and least reliable networks with certain parameters.

We will go outside and have 25 people stand on a 5 by 5 square board. Everyone will be asked to move to one adjacent square, but after everyone moves, we should not have two people in the same square.

Can those 25 people comply?

We will look at this question and some minor variations – and everyone can have a chance to be "in the box."

All epsilon talks are open to the entire campus. Light drinks and snacks will be provided.