European Conference on Combinatorics, Graph Theory and Applications

Seville, September 11 - 15, 2007

 

Program (.pdf)Program

Thursday 13

Program (.pdf)Program

Tuesday   Wednesday   Thursday   Friday   Saturday

8:45-9:45

Leray complexes - combinatorics and geometry

Roy Meshulam

9:45-10:15

Coffee break

 

lecture room A

lecture room B

lecture room C

10:15-10:35

Large Monochromatic Components in Two-colored Grids

Jiří Matoušek and Aleš Přívětivý

Bounds on the Number of Maximal Sum-Free Sets

Guy Wolfovitz

Homomorphisms and Polynomial Invariants of Graphs     

Delia Garijo, Jaroslav Nešetřil and M.  Pastora Revuelta

10:35-10:55

Graph coloring with no large monochromatic components

Nathan Linial, Jiří Matoušek, Or Sheffet and Gábor Tardos

The Hardness of Approximating Poset Dimension

Rajneesh Hegde and Kamal Jain

On Finite Maximal Antichains in the Homomorphism Order

Jan Foniok, Jaroslav Nešetřil and Claude Tardif

10:55-11:15

Coloring circle graphs

Jakub Černý

 

Optimizing diversity                  

Yannick Frein, Benjamin Lévêque and András Sebö

 

Study of Critical Sets in Latin Squares by using the Autotopism Group

Raúl Falcón

11:15-11:35

Oriented vertex and arc-colorings of partial 2-trees

Pascal Ochem and Alexandre Pinlou

Discrepancy of Sums of two Arithmetic Progressions

Nils Hebbinghaus

Finite duality for some minor closed classes homomorphisms

Yared Nigussie and Jaroslav Nešetřil

11:35-11:45

Short break

11:45-12:15

Poster talks

  • P1F Generalized Petersen Graphs - S. Bonvicini, G. Mazzuoccolo
  • On the automorphism group of a 2-factorization of the complete graph - Giuseppe Mazzuoccolo
  • On the Spectra of Hypertrees - Lali Barriére, Francesc Comellas, Cristina Dalfó, Miquel Ángel Fiol
  • 4-critical wheel graphs of higher order - Dainis Zeps

12:15-14:30

Lunch

14:30-15:30

Cycles and cliques minors in expanders

Benny Sudakov

15:30-16:00

Coffee break

 

lecture room A

lecture room B

lecture room C

16:00-16:20

Convex Partitions of Graphs

Danilo Artigas, Mitre C. Dourado and Jayme L. Szwarcfiter

Normal Cayley digraphs on minimal non-abelian groups

Mehdi Alaeiyan and Mohsen Ghasemi

Ramsey numbers of sparse hypergraphs

Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis and Deryk Osthus

16:20-16:40

Extremal graph theory for metric dimension and diameter

Carmen Hernando, Merce Mora, Ignacio M. Pelayo, Carlos Seara and David R. Wood

Generalizations of Khovanskiĭ's theorem on growth of sumsets in abelian semigroups

Vít Jelínek and Martin Klazar

Linear Ramsey numbers for bounded-degree hypergraphs

Yoshiyasu Ishigami

16:40-17:00

Vertex fusion under diameter constraints

Marc Comas and Maria Serna

 

A Spectral study of the Manhattan Networks

Francesc Comellas, Cristina Dalfó, Miquel Angel Fiol and Margarida Mitjana

On some extremal properties of hypergraph colorings

Dmitry A. Shabanov

 

17:00-17:20

Isometric embeddings of subdivided complete graphs in the hypercube           

Laurent Beaudou, Sylvain Gravier and Kahina Meslem

The multidimensional Manhattan network

Francesc Comellas, Cristina Dalfó and Miguel Angel Fiol

Partial Colorings of Unimodular Hypergraphs

Benjamin Doerr

20:30

Conference Banquet in Rio Grande restaurant

 Tuesday   Wednesday   Thursday   Friday   Saturday