• CARMA SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Honeycomb Toroidal Graphs: A Drama in Three Acts
  • Location: Room V205, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Tue, 9th May 2017
  • Abstract:

    I am going to look at three unsolved graph theory problems for which the same family of graphs presents a barrier to either solving or making substantial progress on the problems. The graphs in this family are called honeycomb toroidal graphs. The three problems are not closely related.

  • [Permanent link]



  • "I WISH I'D KNOWN..." SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: How to choose thesis and post-doc project topics
  • Location: Room V111, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 10th Nov 2016
  • The first in a new series of CARMA seminars.
  • Abstract:

    Targeted Audience: All early career staff and PhD students; other staff welcome

    Abstract: Many of us have been involved in discussions revolving around the problem of choosing suitable thesis topics and projects for post-graduate students, honours students and vacation research students. The panel is going to present some ideas that we hope people in the audience will find useful as they get ready for or continue with their careers.

    About the Speakers: Professor Brian Alspach has supervised thirteen PhDs, twenty-five MScs, nine post-doctoral fellows and a dozen undergraduate scholars over his fifty-year career. Professor Eric Beh has 20 years' international experience in the analysis of categorical data with a focus on data visualisation. He has and has, or currently is, supervised about a 10 PhD students. Dr Mike Meylan has twenty years research experience in applied mathematics both leading projects and working with others. He has supervised 5 PhD students and three post-doctoral fellows.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Hoffman-Singleton paper of 1964
  • Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Mon, 7th Nov 2016
  • Abstract:

    Today's discrete mathematics seminar is dedicated to Mirka Miller. I am going to present the beautiful Hoffman-Singleton (1964) paper which established the possible values for valencies for Moore graphs of diameter 2, gave us the Hoffman-Singleton graph of order 50, and gave us one of the intriguing still unsettled problems in combinatorics. The proof is completely linear algebra and is a proof that any serious student in discrete mathematics should see sometime. This is the general area in which Mirka made many contributions.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Essential Points
  • Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Mon, 31st Oct 2016
  • Abstract:

    This afternoon (31 October) we shall complete the discussion about vertex-minimal graphs with dihedral automorphism groups. I have attached an outline of what was covered in the first two weeks.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Minimal-order graphs with dihedral automorphism group
  • Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Mon, 24th Oct 2016
  • Abstract:

    This week we shall continue by introducing the cast of characters to be used for producing minimal-order graphs with dihedral automorphism group.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Graphs And Their Automorphism Groups
  • Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Mon, 17th Oct 2016
  • Abstract:

    Konig (1936) asked whether every finite group G is realized as the automorphism group of a graph. Frucht answered the question in the affirmative and his answer involved graphs whose orders were substantially bigger than the orders of the groups leading to the question of finding the smallest graph with a fixed automorphism group. We shall discuss some of the early work on this problem and some recent results for the family of dihedral groups.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Sequenceable and R-sequenceable groups
  • Location: Room V205, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Wed, 13th Apr 2016
  • Abstract:

    This week I shall finish my discussion of sequenceable and R-sequenceable groups.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Circulant graphs isomorphic to Cartesian products of cycles
  • Location: Room V205, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Sun, 10th Apr 2016
  • Abstract:

    I am now refereeing a manuscript on the above and I’ll tell you about its contents.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Orthogonalizeable groups
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Wed, 6th Apr 2016
  • Abstract:

    B. Gordon (1961) defined sequenceable groups and G. Ringel (1974) defined R-sequenceable groups. Friedlander, Gordon and Miller conjectured that finite abelian groups are either sequenceable or R-sequenceable. The preceding definitions are special cases of what T. Kalinowski and I are calling an orthogonalizeable group, namely, a group for which every Cayley digraph on the group admits either an orthogonal directed path or an orthogonal directed cycle. I shall go over the history and current status of this topic along with a discussion about the completion of a proof of the FGM conjecture.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Several Beautiful Proofs
  • Location: Room V31, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Wed, 29th Jul 2015
  • Abstract:

    Mathematicians sometimes speak of the beauty of mathematics which to us is reflected in proofs and solutions for the most part. I am going to give a few proofs that I find very nice. This is stuff that post-grad discrete students certainly should know exists.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Pancyclicty and Cayley graphs on generalized dihedral groups
  • Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 1:00 pm, Wed, 25th Mar 2015
  • Abstract:

    This week I shall conclude my discussion of pancyclicity and Cayley graphs on generalized dihedral groups.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Pancyclicty and Cayley graphs on generalized dihedral groups
  • Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 1:00 pm, Wed, 18th Mar 2015
  • Abstract:

    This is joint work with our former honours student Alex Muir. We look at the variety of lengths of cycles in Cayley graphs on generalized dihedral groups.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Pancyclicty and Cayley graphs on generalized dihedral groups
  • Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 1:00 pm, Wed, 11th Mar 2015
  • Abstract:

    This is joint work with our former honours student Alex Muir. We look at the variety of lengths of cycles in Cayley graphs on generalized dihedral groups.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Searching Graphs: IV
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 2nd Oct 2014
  • Abstract:

    This week I shall finish my discussion about searching graphs by looking at the recent paper by Clarke and MacGillavray that characterizes graphs that are k-searchable.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Graph searching characterization results
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 18th Sep 2014
  • Abstract:

    This Thursday, sees a return to graph searching in the discrete mathematics instructional seminar. I’ll be looking at characterization results.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Searching graphs embedded on the torus
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 21st Aug 2014
  • Abstract:

    Brian Alspach will continue discussing searching graphs embedded on the torus.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Basic Pursuit-Evasion In Graphs
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 14th Aug 2014
  • Abstract:

    This week I shall continue the discussion of searching graphs.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Basic Pursuit-Evasion In Graphs
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 7th Aug 2014
  • Abstract:

    This week I shall start a series of talks on basic pursuit-evasion in graphs (frequently called cops and robber in the literature). We shall do some topological graph theory leading to an intriguing conjecture, and we'll look at a characterization problem.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: A graph theory research project
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 31st Jul 2014
  • Abstract:

    I shall be describing a largely unexplored concept in graph theory which is, I believe, an ideal thesis topic. I shall be presenting this at the CIMPA workshop in Laos in December.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: A new graph construction using groups
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 10th Jul 2014
  • Abstract:

    We shall finish our look at two-sided group graphs.

  • [Permanent link]


  • AUSTRALIAN MATHEMATICAL SCIENCES STUDENT CONFERENCE
  • Public Lecture
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Lost Spelunkers, Cops And Robbers and Is Someone Trying To Destroy My Network?
  • Location: Room V07, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 6:30 pm, Wed, 2nd Jul 2014
  • Abstract:

    What do the three elements of the title have in common is the utility of using graph searching as a model. In this talk I shall discuss the relatively brief history of graph searching, several models currently being employed, several significant results, unsolved conjectures, and the vast expanse of unexplored territory.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: A new graph construction using groups
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 26th Jun 2014
  • Abstract:

    I am refereeing a manuscript in which a new construction for producing graphs from a group is given. There are some surprising aspects of this new method and that is what I shall discuss.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Oberwolfach Problem Re-Visited
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 15th May 2014
  • Abstract:

    This year is the fiftieth anniversary of Ringel's posing of the well-known graph decomposition problem called the Oberwolfach problem. In this series of talks, I shall examine what has been accomplished so far, take a look at current work, and suggest a possible new avenue of approach. The material to be presented essentially will be self-contained.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Oberwolfach Problem Re-Visited
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 8th May 2014
  • Abstract:

    This year is the fiftieth anniversary of Ringel's posing of the well-known graph decomposition problem called the Oberwolfach problem. In this series of talks, I shall examine what has been accomplished so far, take a look at current work, and suggest a possible new avenue of approach. The material to be presented essentially will be self-contained.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Oberwolfach Problem Re-Visited
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 17th Apr 2014
  • Abstract:

    This year is the fiftieth anniversary of Ringel's posing of the well-known graph decomposition problem called the Oberwolfach problem. In this series of talks, I shall examine what has been accomplished so far, take a look at current work, and suggest a possible new avenue of approach. The material to be presented essentially will be self-contained.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The proof of Manickam-Miklos-Singhi
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 10th Apr 2014
  • Abstract:

    : In this final talk of the sequence we will sketch Blinovsky's recent proof of the conjecture: Whenever n is at least 4k, and A is a set of n numbers with sum 0, then there are at least (n-1) choose (k-1) subsets of size k which have non-negative sum. The nice aspect of the proof is the combination of hypergraph concepts with convex geometry arguments and a Berry-Esseen inequality for approximating the hypergeometric distribution. The not so nice aspect (which will be omitted in the talk) is the amount of very tedious algebraic manipulation that is necessary to verify the required estimates. There are slides for all four MMS talks here.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: From EKR to MMS
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 3rd Apr 2014
  • Abstract:

    The Erdos-Ko-Rado (EKR) Theorem is a classical result in combinatorial set theory and is absolutely fundamental to the development of extremal set theory. It answers the following question: What is the maximum size of a family F of k-element subsets of the set {1,2,...,n} such that any two sets in F have nonempty intersection?

    In the 1980's Manickam, Miklos and Singhi (MMS) asked the following question: Given that a set A of n real numbers has sum zero, what is the smallest possible number of k-element subsets of A with nonnegative sum? They conjectured that the optimal solutions for this problem look precisely like the extremal families in the EKR theorem. This problem has been open for almost 30 years and many partial results have been proved. There was a burst of activity in 2012, culminating in a proof of the conjecture in October 2013.

    This series of talks will explore the basic EKR theorem and discuss some of the recent results on the MMS conjecture.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: From EKR to MMS
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 20th Mar 2014
  • Abstract:

    The Erdos-Ko-Rado (EKR) Theorem is a classical result in combinatorial set theory and is absolutely fundamental to the development of extremal set theory. It answers the following question: What is the maximum size of a family F of k-element subsets of the set {1,2,...,n} such that any two sets in F have nonempty intersection?

    In the 1980's Manickam, Miklos and Singhi (MMS) asked the following question: Given that a set A of n real numbers has sum zero, what is the smallest possible number of k-element subsets of A with nonnegative sum? They conjectured that the optimal solutions for this problem look precisely like the extremal families in the EKR theorem. This problem has been open for almost 30 years and many partial results have been proved. There was a burst of activity in 2012, culminating in a proof of the conjecture in October 2013.

    This series of talks will explore the basic EKR theorem and discuss some of the recent results on the MMS conjecture.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: From EKR to MMS
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 13th Mar 2014
  • Abstract:

    The Erdos-Ko-Rado (EKR) Theorem is a classical result in combinatorial set theory and is absolutely fundamental to the development of extremal set theory. It answers the following question: What is the maximum size of a family F of k-element subsets of the set {1,2,...,n} such that any two sets in F have nonempty intersection?

    In the 1980's Manickam, Miklos and Singhi (MMS) asked the following question: Given that a set A of n real numbers has sum zero, what is the smallest possible number of k-element subsets of A with nonnegative sum? They conjectured that the optimal solutions for this problem look precisely like the extremal families in the EKR theorem. This problem has been open for almost 30 years and many partial results have been proved. There was a burst of activity in 2012, culminating in a proof of the conjecture in October 2013.

    This series of talks will explore the basic EKR theorem and discuss some of the recent results on the MMS conjecture.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Hamilton decompositions of vertex-transitive graphs of prime-squared order
  • Location: Room V101, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 4th Jul 2013
  • Abstract:

    In a recent referee report, the referee said he/she could not understand the proofs of either of the two main results. Come and judge for yourself! This is joint work with Darryn Bryant and Don Kreher.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Gallai's 1966 conjecture on path decompositions
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 25th Oct 2012
  • Abstract:

    In 1966 Gallai conjectured that a connected graph of order n can be decomposed into n/2 or fewer paths when n is even, or (n+1)/2 or fewer paths when n is odd. We shall discuss old and new work on this as yet unsolved conjecture.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Gallai's 1966 conjecture on path decompositions
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 18th Oct 2012
  • Abstract:

    In 1966 Gallai conjectured that a connected graph of order n can be decomposed into n/2 or fewer paths when n is even, or (n+1)/2 or fewer paths when n is odd. We shall discuss old and new work on this as yet unsolved conjecture.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Turning Group Theory Into Graph Theory
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 6th Sep 2012
  • Abstract:

    This week Brian Alspach will complete the discussion on Burnside's Theorem and vertex-transitive graphs of prime order.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Turning Group Theory Into Graph Theory
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 30th Aug 2012
  • Abstract:

    We shall continue exploring implications of Burnside's Theorem for vertex-transitive graphs.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Turning Group Theory Into Graph Theory
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 23rd Aug 2012
  • Abstract:

    We shall continue exploring implications of Burnside's Theorem for vertex-transitive graphs.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Turning Group Theory Into Graph Theory
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 16th Aug 2012
  • Abstract:

    Burnside's Theorem characterising transitive permutation groups of prime degree has some wonderful applications for graphs. This week we start an exploration of this topic.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The elusive snark
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 9th Aug 2012
  • Abstract:

    Snarks are 3-regular graphs that are not 3-edge-colourable and are cyclically 4-edge-connected. They exist but are hard to find. On the other hand, it is believed that Cayley graphs can never be snarks. The latter is the subject of the next series of talks.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The elusive snark
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 2nd Aug 2012
  • Abstract:

    Snarks are 3-regular graphs that are not 3-edge-colourable and are cyclically 4-edge-connected. They exist but are hard to find. On the other hand, it is believed that Cayley graphs can never be snarks. The latter is the subject of the next series of talks.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The elusive snark
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 26th Jul 2012
  • Abstract:

    Snarks are 3-regular graphs that are not 3-edge-colourable and are cyclically 4-edge-connected. They exist but are hard to find. On the other hand, it is believed that Cayley graphs can never be snarks. The latter is the subject of the next series of talks.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Anatomy Of A Famous Conjecture
  • Location: Room V27, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 31st May 2012
  • Abstract:

    This week Brian Alspach concludes his series of talks entitled "The Anatomy Of A Famous Conjecture." We shall be in V27 - note room change.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Anatomy Of A Famous Conjecture
  • Location: Room MC110, McMullin Building (Callaghan Campus)
  • Time and Date: 3:00 pm, Thu, 24th May 2012
  • Abstract:

    Brian Alspach will continue his discussion "The Anatomy Of A Famous Conjecture."

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Anatomy Of A Famous Conjecture
  • Location: Room MC110, McMullin Building (Callaghan Campus)
  • Time and Date: 3:00 pm, Thu, 17th May 2012
  • Abstract:

    Brian Alspach will continue his discussion "The Anatomy Of A Famous Conjecture."

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Anatomy Of A Famous Conjecture
  • Location: Room MC110, McMullin Building (Callaghan Campus)
  • Time and Date: 3:00 pm, Thu, 10th May 2012
  • Abstract:

    Brian Alspach will continue his discussion "The Anatomy Of A Famous Conjecture."

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Anatomy Of A Famous Conjecture
  • Location: Room MC110, McMullin Building (Callaghan Campus)
  • Time and Date: 3:00 pm, Thu, 26th Apr 2012
  • Abstract:

    Brian Alspach will continue with "The Anatomy Of A Famous Conjecture" this Thursday. One can easily pick up the thread this week without having attended last week, but if you miss this week it will not be easy to join in next week.

  • [Permanent link]


  • CARMA SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Coxeter Group Project: A Progress Report
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 19th Apr 2012
  • Abstract:

    I have embarked on a project of looking for Hamilton paths in Cayley graphs on finite Coxeter groups. This talk is a report on the progress thus far.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Anatomy of a Famous Conjecture
  • Location: Room MC110, McMullin Building (Callaghan Campus)
  • Time and Date: 3:00 pm, Thu, 19th Apr 2012
  • Abstract:

    Brian Alspach will continue with "The Anatomy of a Famous Conjecture" this Thursday. One can easily pick up the thread this week without having attended last week, but if you miss this week it will not be easy to join in next week.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Anatomy of a Famous Conjecture
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 12th Apr 2012
  • Abstract:

    In my opinion, the most significant unsolved problem in graph decompositions is the cycle double conjecture. This begins a series of talks on this conjecture in terms of background, relations to other problems and partial results.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: More Cayley Digraphs
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 3rd Nov 2011
  • Abstract:

    This week we shall conclude our look at the paper by Dave Witte on Hamilton directed cycles in Cayley digraphs of prime power order.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Cayley Digraphs
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 27th Oct 2011
  • Abstract:

    We shall start looking at Dave Witte's (now Dave Morris) proof that connected Cayley digraphs of prime power order have Hamilton directed cycles.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Lovasz Problem Pt II
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 15th Sep 2011
  • Abstract:

    This week the discrete mathematics instructional seminar will continue with a consideration of the Lovasz problem. This is the last meeting of the seminar until 13 October.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Lovasz's Conjecture
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 8th Sep 2011
  • Abstract:

    The topic is Lovasz's Conjecture that all connected vertex-transitive graphs have Hamilton paths.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title:
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 1st Sep 2011
  • Abstract:

    This Thursday is your chance to start anew! I shall be starting a presentation of the best work that has been done on Lovasz's famous 1979 problem (now a conjecture) stating that every connected vertex-transitive graph has a Hamilton path. This is good stuff and requires minimal background.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The 1960 Hoffman-Singleton Paper: Part III
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 25th Aug 2011
  • Abstract:

    This week we shall conclude the proof of the uniqueness of the Hoffman-Singleton graph.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The 1960 Hoffman-Singleton Paper: Part III
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 18th Aug 2011
  • Abstract:

    We continue looking at the 1960 Hoffman-Singleton paper about Moore graphs and related topics.

  • [Permanent link]


  • CARMA-GTA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: The Edmonds-Fulkerson matroid partition theorem
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 5th May 2011
  • Abstract:

    We meet this Thursday at the usual time when I will show you a nice application of the Edmonds-Fulkerson matroid partition theorem, namely, I'll prove that Paley graphs have Hamilton decompositions (an unpublished result).

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Discrete Mathematics Instructional Seminar
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 14th Apr 2011
  • Abstract:

    This week we shall start the classical paper by Jack Edmonds and DR Fulkerson on partitioning matroids.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Discrete Maths Seminar
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 7th Apr 2011
  • Abstract:

    We shall conclude the discussion of some of the mathematics surrounding Birkhoff's Theorem about doubly stochastic matrices.

  • [Permanent link]


  • CARMA DISCRETE MATHEMATICS SEMINAR
  • Speaker: Prof Brian Alspach, CARMA, The University of Newcastle
  • Title: Discrete Maths Seminar: Introductions
  • Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 24th Feb 2011
  • Abstract:

    This is a discrete mathematics instructional seminar commencing 24 February--to meet on subsequent Thursdays from 3:00-4:00 p.m. The seminar will focus on "classical" papers and portions of books.

  • [Permanent link]