DIMACS/DIMATIA/Rényi Working Group on Algebraic and Geometric Methods in Combinatorics III

Third Meeting: November 7 - 9, 2005
Location: DIMACS Center, CoRE Building, Rutgers University

Organizers:
Jaroslav Nesetril, Charles University, nesetril at kam.mff.cuni.cz
Fred Roberts, DIMACS, froberts@dimacs.rutgers.edu

The Rényi Institute Home Page

DIMACS/DIMATIA/Rényi Working Group on Algebraic and Geometric Methods in Combinatorics Main Page

DIMACS/DIMATIA/Renyi Tripartite Partnership

Workshop Program:

Monday, November 7, 2005

 9:15 -  9:45  Registration and Breakfast at DIMACS 
               CoRE Building, 4th Floor Lounge

 9:45 - 10:00  Welcome and introductory remarks
               Fred Roberts, DIMACS and Jarik Nesetril, DIMATIA 
            
10:00 - 10:30  Bounded expansion versus minors  
               Jarik Nesetril, DIMATIA
          
10:35 - 11:05  Graph properties recognizable by number of 
               homomorphisms from restricted classes of graphs            
               Zdenek Dvorak, DIMATIA
            
11:10 - 11:35  Break

11:35 - 12:05  Bounding the number of edges in permutation graphs
               Po-Shen Loh, Princeton University
            
12:10 -  1:00  Lunch at DIMACS

 1:00 -  2:00  Discussion Period

 2:00 -  2:30  On a restricted cross-intersection problem
               Benjamin Sudakov, Princeton University
           
 2:35 -  3:00  Break

 3:00 -  3:30  Diameters of duals are linear
               Ida Svejdarova, University of Illinois, Urbana Champaign

 3:35 -  4:30  Open Problems and Discussion

 5:30          Banquet at DIMACS

Tuesday, November 8, 2005

 9:30 - 10:00  Breakfast at DIMACS - CoRE Building, 4th Floor Lounge

10:00 - 10:30  Laplacians, Homology and Hypergraph Matchings
               Roy Meshulam, Technion 

10:35 - 11:05  Open cups and open caps
               Jakub Cerny, DIMATIA
            
11:10 - 11:35  Break

11:35 - 12:05  Hamiltonian cycles in Dirac graphs
               Bill Cuckler, Rutgers University
             
12:10 -  1:00  Lunch at DIMACS

 1:00 -  2:00  Discussion Period

 2:00 -  2:30  Bounding the partition function of spin-system
               David Galvin, University of Pennsylvania
           
 2:35 -  3:00  Break

 3:00 -  3:30  Small separations in symmetric graphs
               Bojan Mohar, Simon Fraser University
             
 3:35 -  4:30  Open Problems and Discussion

 5:30          Wine and Hor d'Oeuvres Reception

Wednesday, November 9, 2005

 9:30 -  10:00 Breakfast at DIMACS - CoRE Building, 4th Floor Lounge

10:00 - 10:30  The circular chromatic index of graphs of high girth
               Dan Kral, Georgia Institute of Technology 
              
10:35 - 11:05  Some bounds on the circular chromatic number of sparse graphs
               Andre Raspaud, Laboratoire Bordelais de Recherche en Informatique 
               
11:10 - 11:35  Break

11:35 - 12:05  Random matrices: Questions and Answers
               Van Vu, Rutgers University
             
12:10 -  1:00  Lunch at DIMACS

 1:00 -  2:00  Discussion Period
Previous: Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on October 31, 2005.