• Speaker: Prof Wal Wallis, Department of Mathematics, Southern Illinois University
  • Title: Minimal Pancyclic Graphs
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 1:00 pm, Tue, 5th Jun 2012
  • Abstract:

    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. We shall look 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.

  • [Permanent link]