Presented by: 
Wal Wallis (Southern Illinois University)
Tue 22 May, 3:00 pm - 4:00 pm
Room 442, Building 67

A graph on v vertices is called pancyclic if it contains cycles of every length from 3 to v. Obviously such graphs exist — the complete graph on v vertices is an example. This seminar looks at the question: what is the minimum number of edges in a pancyclic graph? Interestingly, this question was “solved”, incorrectly, in 1978. A complete solution is not yet known.