MIGHTY XXXV SCHEDULE

To retrieve the abstracts in pdf mode mightyabstracts.pdf

 

FRIDAY, Sept. 27, 2002

3:00-3:45pm
Registration & Coffee in ROOM 401, Stevenson Hall
3:45-4:00pm 
CURTAIN RAISER (ROOM 401)
George Seelinger, Chairperson, Department of Mathematics
4:00-5:00pm
INVITED LECTURE (ROOM 401)
MICHAL MORAYNE, The Secretary Problem
5:30-7:00pm
Informal Dinner at local restaurants
7:30-9:30pm
Reception in the University Galleries,
Center for Visual Arts (CVA)

 

SATURDAY, Sept. 28, 2002

8:30-9:00am: Registration and Coffee In ROOM 401, Stevenson Hall
9:00-9:10am WELCOME
ROOM 401 Al Bowman, Provost, Illinois State University
9:10-9:30am  
ROOM 401
Alexandr Kostochka
On a theorem of Erdos, Rubin and Taylor
ROOM 401A
Harry Calkins
Graph Theory package now in Mathematica
ROOM 311
Dhruv Mubayi
An explicit construction for a generalized Ramsey problem
9:35-9:55am  
ROOM 401
Zsuzsanna Szaniszlo
On partial vertex list colorings
ROOM 401A
Grzegorz Kubicki
A linear algorithm for finding the reinforcement number of a tree
ROOM 311
Douglas B. West
The smallest k-regular, h-connected graphs without 1 -factors
10:00-10:20am  
ROOM 401
Michael Pelsmajer
Equitable choosability for graphs of bounded tree-width.
ROOM 401A
Jay Bagga and Elizabeth VandenBerg
Jedit - a Java graph editor
ROOM 311
Mustafa Atici
Integrity of regular graphs and integrity graphs
10:25-10:45am  
ROOM 401
Kittikorn Nakprasit
Equitable colorings of k-degenerate graphs
ROOM 401A
J. Michael McGrew
Connectivity properties of visibility graphs and contracted visibility graphs
ROOM 311
Sergei Bezrukov
On an extremal problem on hypergraphs
10:45-11:00am: Coffee Break
11:00-noon 
INVITED LECTURE (ROOM 401)
MICHAL MORAYNE, The chromatic number of the Euclidean plane
Noon-1:35pm: Lunch Break
1:35-1:55pm  
ROOM 401
Allen J. Schwenk
An eigenvalue proof of the uniqueness of the Ramsey graph for K4 versus K4
ROOM 401A
Chip Vandell
On the integrity and arc-integrity for orientations of the hypercube
ROOM 311
Darren Parker
On the breadth of lattices of convex sets in multipartite tournaments
2:00-2:20pm  
ROOM 401
L. Leslie Gardner
The multiplicity of eigenvalues in the adjacency matrix of a tree
ROOM 401A
Terry Mckee
Graph orientations and signings that are saturated with alternating cycles
ROOM 311
Jozef Skokan
Packing of jacks
 2:25-2:45pm  
ROOM 401
Jeong-Hyun Kang
L(2,1)-labeling and packing of bipartite graphs
ROOM 401A
Anant Godbole
Probabilistic results concerning Seymour's distance two conjecture
ROOM 311
Ian Roberts
Some matching problems in the Boolean lattice
2:45-3:00pm: Coffee Break
3:00-3:20pm  
ROOM 401
Yi Zhao
The regularity lemma and graph embedding
ROOM 401A
Rui Xu
Group connectivity of squares of graphs
ROOM 311
Linda Eroh
What are the possible sets of edge-deleted eccentricities of a graph?
ROOM TBA
Lane Clark
The strong matching number of a random graph
3:25-3:45pm  
ROOM 401
Joe Johnson
Even submatrices of zero-one matrices
ROOM 401A
Daniel Slilaty
Flow-difference functions of graphs
ROOM 311
Dalibor Froncek
Cyclic decompositions of complete graphs into spanning trees
ROOM TBA
Jerald A. Kabell
Some graph-theoretic models for sequencing operations in a stateful system
3:50-4:10pm  
ROOM 401
Gabriel Zimmer
Random growth of caterpillar graphs
ROOM 401A
Matthew Walsh
The maximum dimension of a shallow graph
ROOM 311
Jeno Lehel
Longest paths in circular arc graphs
ROOM TBA
Yehong Shao
Every 4-connected line graph of an almost claw-free graph is hamiltonian connected
4:15-4:35pm  
ROOM 401
Seog-Jin Kim
On the chromatic number of intersection graphs of convex sets on the plane
ROOM 401A
Mingquan Zhan
Supereulerian matroids
ROOM 311
Zhi-Hong Chen
Spanning trails containing given edges
5:15-7:00pm
Survivors' Dinner at Ned Kelly's Restaurant,
1603A Morrisey Drive, Bloomington 


Return to MIGHTY XXXV Website