Combinatorics Seminar 9/21/2011

Date: 9/21/2011
Time: 3:30 PM
Place: 315 Armstrong Hall

We will have two 25 minute talks on the cycle double cover
conjecture, one by Dong Ye, the other by Wenliang Tang. Summaries:

Cycle double cover on cubic graphs with large circumference
Dong Ye

Let G be a bridgeless cubic graph with n vertices. The circumference
of G is the size of a longest circuit of G. By using computers,
Hagglund and Markstom verified that G has a cycle double cover if its
circumference is at least n-9. In this talk, we give a direct proof to
show that a cubic graph G with circumference at least n-8 has a cycle
double cover.

Strong cycle double cover conjecture on two special classes of graphs
Wenliang Tang

Let G be a bridgeless cubic graph and C is any given circuit in G, it was
conjectured that we can find a family of circuits containing C such that
every edge of G is covered exactly by two members of this family. This is
the well-known "Strong Circuit Double Cover Conjecture". I am going to
verify this conjecture on two special classes of cubic graphs.

Date, Location: 

Professor Moseley 9/1/2011

I will be giving an undergraduate colloquium on Thursday
September 1, 2011 in Armstrong 315 at 3:30 to help everyone to
understand the "Linear Operator Theory" approach to Math 251 and Math
261. See attached. Not all in Math 251 and Math 261 is Linear Theory,
but enough is to make this approach reasonable, especially for the
engineers. About 90-99% of the students in Math 251 and Math 261 are
engineers. They need to know what a Linear System is from a mathematical
perspective. This begins with the definition of a vector space as an
abstract algebraic structure. Students (engineering and others) find
this hard, but math avoidance is not the answer. In my classes I am
trying to keep them from getting stuck in 3 space. (Please help me.
I'm stuck in 3 space and I can't get out.) The sooner they are exposed
to the Euclidean view of mathematics, the better. This does not
necessarily mean a lot of proofs. I do very few proofs. You and all
of your students are invited. If we overflow, we will move to Eiesland
G34 (the auditorium) provided I can figure out how to run the
technology. I have enough overheads for 2-3 hours. However, I have cut
it down to a 10-20 minute talk plus questions. Hope to see you there.

PDF for colloquium can be downloaded here

Date, Location: 


The schedule of colloquia / seminars will be posted in August 2011.

Date, Location: 


Subscribe to