DIMACS/DIMATIA/Renyi Combinatorial Challenges Meeting
April 26 - 29, 2006
Location: DIMACS Center, CoRE Building, Rutgers University
- Organizers:
- Brenda Latka, Program Chair, DIMACS, latka@dimacs.rutgers.edu
- Gyula Katona, Alfréd Rényi Institute, ohkatona@renyi.hu
- Jaroslav Nesetril, Charles University, nesetril at kam.mff.cuni.cz
- Fred Roberts, DIMACS, froberts@dimacs.rutgers.edu
The Rényi Institute Home Page
DIMATIA Home Page
DIMACS/DIMATIA/Renyi Tripartite Partnership
This conference is being held in conjunction with the Conference on Probabilistic Combinatorics & Algorithms:
a Conference in Honor of Joel Spencer's 60th Birthday, April 24 - 25, 2006, and conference participants are urged to consider attending both meetings. More information about the Conference on Probabilistic Combinatorics & Algorithms: a Conference in Honor of Joel Spencer's 60th Birthday is available at http://dimacs.rutgers.edu/Workshops/Spencer/.
Slides
- Noga Alon, Tel-Aviv University and IAS
Tournaments
- Vera Asodi, Tel-Aviv University
Tracing a Single User
- Drago Bokal, Simon Fraser University
Circular chromatic number of hexagonal chains with orientations
- Milan Bradonjic, University of California
General Geographical Threshold Graphs
- Joshua Cooper, Institute of Theoretical Computer Science
Foundations of Quasirandomness
- Daniel Cranston, University of Illinois
Edge-choosability of planar graphs with no two adjacent triangles
- Robert Ellis, Illinois Institute of Technology
Coverings and packings for radius 1 adaptive block coding
- Daniel Gerbner, Eotvos University
Profile vectors in the poset of subspaces
- Jerry Griggs, University of South Carolina
Real Number Labellings
- Stephen Hartke, University of Illinois
Degree-Sequence-Forcing Sets
- Hemanshu Kaul, University of Illinois
Distinguishing Chromatic Number of
Cartesian Products of Graphs
- Graeme Kemkes, University of Waterloo
On the chromatic number of a random 5-regular graph
- Balazs Keszegh, Alfréd Rényi Institute
Forbiddensubmatrices in 0-1 matrices
- Daniel Kral, Georgia Institute of Technology
Group-Valued Edge Colourings of Cubic Graphs
- Vadim Lozin, Rutgers University
Between 2- and 3-colorability
- Dezso Miklos, Alfréd Rényi Institute
Subsums of a finite sum and extreme sets of vertices of the hypercube
- Pavel Nejedly, Georgia Tech
Choosability of Graphs with Infinite Sets of Forbidden Differences
- Fred Roberts, DIMACS
Graph-theoretical Problems Arising from Defending
Against Bioterrorism and Controlling the Spread of Fires
- Vera Sos, Alfréd Rényi Institute
Convergence of Graphs and Generalized Quasirandom Graphs
- Joel Spencer, Courant Institute
Ugly proofs and Book proofs
- Laszlo Szekely, University of South Carolina
Biplanar Crossing Numbers
- Sujith Vijay, Rutgers University
The Discrepancy of Quasi-arithmetic Progressions:
Power of N or Power of log N?
- Van Vu, Rutgers University
Random Polytopes
- Doug West, University of Illinois - Urbana
Parity Edge-Coloring of Graphs
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on May 30, 2006.