## Knots and Links in Graphs |

**Brenda Johnson**

Union College

January 14, 2013

4:30 pm

Bailey Hall 207

Refreshments will be served in Bailey Hall 204 at 4:15

Consider a computer system with six components, each of which has to be connected to each of the others by a cable or wire. The result is a mess, but how messy is it? The mathematical analog of this set up is called a spatial embedding of the complete graph on six vertices. We’ll look at some theorems that describe the minimum degree of messiness in such situations, and some related unanswered questions.

For additional information, send e-mail to math@union.edu or call (518) 388-6246.

Union College Math Department Home PageComments to: math@union.edu Created automatically on: Fri Jun 22 15:06:59 EDT 2018 |