• Speaker: Prof Mirka Miller, School of Mathematical and Physical Sciences, The University of Newcastle
  • Title: Degree/Diameter Problem
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 12th Sep 2013
  • Abstract:

    The degree/diameter problem is to find the largest possible order of a graph (or digraph) with given maximum degree (or maximum out-degree) and given diameter. This is one of the unsolved problems in Extremal Graph Theory. Since the general problem is difficult many variations of the problem have been considered, including bipartite, vertex-transitive, mixed, planar, etc.

    This talk is part of a series started in May. The provisional schedule is

    • 10 May Novi Bong: Proof of the non-existence of undirected Moore graphs for diameter 2 and 3 (Hoffman and Singleton, 1960)
    • 5 September Guillermo Pineda-Villavicencio: New results in the degree/diameter problem for surfaces
    • 12 September Mirka Miller: Repeats and mixed Moore graphs
    • 19 September Mirka Miller: Constructions of large graphs and digraphs
    • 26 September Edy Tri Baskoro: Repeat permutations in almost Moore digraphs
    • Mid-semester break
    • 10 October Joe Ryan: Subgraph degree/diameter problem
    • Another break...to be continued in November

  • [Permanent link]