Program

Full program (pdf version)  and the booklet of the conference (pdf version)

Wednesday July 6th
8:00-8:50 Registration
8:50-9:00 Opening of the conference
Ball: On sets defining few ordinary planes
9:00-10:00
10:00-10:30 Coffee break (R, Q rooms)
Main Room (Sala d’actes) Room S04
10:30-10:50 Josefran De Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer and Fabian Schulenburg. Loose Hamiltonian cycles forced by (k-2)-degree – approximate version M Pastora Revuelta, Luis Boza, J. Manuel Marin and M. Isabel Sanz. Exact value of 3 color weak Rado number
10:50-11:10 Shinya Fujita, Henry Liu and Amites Sarkar. Highly Connected Subgraphs of Graphs with Given Independence Number  Jean-Paul Doignon. A Convex Polytope and an Antimatroid for any Given, Finite Group
11:10-11:30 Tien-Nam Le and Paul Wollan. Forcing clique immersions through chromatic number Clemens Huemer, Alexander Pilz, Carlos Seara and Rodrigo Silveira.  Production matrices for geometric graphs
11:30-11:40 Short break
11:40-12:00 Nicholas Cavenagh and Reshma Ramadurai. On the distances between Latin Squares and the smallest defining set size Pilar Cano, Guillem Perarnau and Oriol Serra. Rainbow perfect matchings in r-partite graph structures
12:00-12:20 Oleg Zaikin, Alexey Zhuravlev, Stepan Kochemazov and Eduard Vatutin. On the Construction of Triples of Diagonal Latin Squares of Order 10 Daniel Kotlar, Ron Aharoni, Ran Ziv and Eli Berger. On rainbow matchings in bipartite graphs
12:30-14:00 LUNCH (Physics Building)
Sudakov: Equiangular lines and spherical codes in Euclidean spaces
14:00-15:00
15:00-15:30 Coffee break (R, Q rooms)
15:30-15:50 Dennis Clemens, Julia Ehrenmüller and Yury Person. A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs Francesc Aguiló, Miquel A. Fiol and Sonia Pérez. A geometric approach to dense Cayley digraphs of finite Abelian groups
15:50-16:10 Tamás Hubai, Dávid Kunszenti-Kovács and László Lovász. Positive graphs Gabriela Araujo-Pardo, Camino Balbuena, Mirka Miller and Maria Zdímalová. A construction of dense mixed graphs of diameter 2
16:10-16:30 Lluis Vena. On limits of sparse random graphs Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena and Manuel Bendala. A new family of small regular graphs of girth 5
16:30-16:40 Short break
16:40-17:30 POSTER SESSION

 

  Thursday July 7th
  Thomassé: Decomposing a graph into paths and trees
9:00-10:00
 
10:00-10:30 Coffee break (R, Q rooms)
  Main Room (Sala d’actes) Room S04
10:30-10:50 Lutz Warnke. Upper tails for arithmetic progressions in random subsets Thomas Selig and Mark Dukes. Decomposing recurrent states of the abelian sandpile model
10:50-11:10 Marc Noy, Clément Requilé and Juanjo Rué. Random cubic planar graphs revisited David Orden, Iván Marsa Maestre, Jose Manuel Gimenez-Guzman and Enrique De La Hoz De La Hoz. Bounds on spectrum graph coloring
11:10-11:30 Ljuben Mutafchiev. On the Distribution of the Number of Goldbach Partitions of a Randomly Chosen Positive Even Integer David E. Roberson. Homomorphisms of Strongly Regular Graphs
11:30-11:40 Short break
11:40-12:00 Cesar Ceballos, Arnau Padrol and Camilo Sarmiento.  Tropical Catalan subdivisions Cristina Fernandez-Cordoba, Carlos Vela and Merce Villanueva. Construction and classification of Z_{2^s}-linear Hadamard codes
12:00-12:20 Francisco Criado and Francisco Santos.  The maximum diameter of pure simplicial complexes and pseudo-manifolds Ivan Bailera, Joaquim Borges and Josep Rifà. About some Hadamard full propelinear (2t,2,2)-codes. Rank and Kernel
12:30-14:00 LUNCH
14:00-14:20 Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos and Martin Milanič. 1-perfectly orientable K_4-minor-free and outerplanar graphs José Cáceres, Delia Garijo, Antonio González, Alberto Márquez, María Luz Puertas and Paula Ribeiro. Shortcut sets for plane Euclidean networks
14:20-14:40 Mariusz Grech and Andrzej Kisielewicz. Cerny conjecture for edge-colored digraphs with few junctions Guillaume Bagan, Fairouz Beggas, Mohammed Haddad and Hamamache Kheddouci. Edge Monitoring Problem on Interval Graphs
14:40-15:00 Richard Lang, Laura Gellert and Henning Bruhn.  Chromatic index, treewidth and maximum degree Josep M. Brunat and Montserrat Maureso. Extreme Weights in Steinhaus Triangles
15:00-15:30 Coffee break (R, Q rooms)
15:30-15:50 Gabor Wiener. On constructions of hypotraceable graphs Carlos Marijuán and Miriam Pisonero.  Comparison of weighted digraphs’ spectral radii that differ in a certain subdigraph
15:50-16:10 Nacho López Lorenzo, Hebert Pérez-Rosés, Jordi Pujolas and Mária Zdímalová. A variant of the McKay-Miller-Sirán construction for mixed graphs Bruno Amaro, Leonardo Lima, Carla Oliveira, Carlile Lavor and Nair Maria Maia de Abreu. A note on the sum of the largest signless Laplacian eigenvalues
16:10-16:30 Vadim Levit and Eugen Mandrescu. Crowns in bipartite graphs Carlos Marijuán, Jesús García López de Lacalle and Luis Miguel Pozo Coronado. Structural and spectral properties of minimal strong digraphs
16:30-16:50 Group photo
16:50-17:30 BUSINESS Meeting (Main Room)
 
     
  20:00: Conference dinner at ‘La Camarga‘ (C. Aribau 117)
 
  Friday July 8th
  Král’: Graph limits and extremal combinatorics
9:00-10:00
 
10:00-10:30 Coffee break (R, Q rooms)
  Main Room (Sala d’actes) Room S04
10:30-10:50 Monica Blanco and Francisco Santos. Enumerating lattice 3-polytopes Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi and John R. Schmitt. On the Alon-Füredi bound
10:50-11:10 Tomoki Nakamigawa. Enumeration Problems on the Expansion of a Chord Diagram Herbert Edelsbrunner and Mabel Iglesias-Ham. Multiple Covers with Balls II: Weighted Averages
11:10-11:30 Andrei Asinowski, Christian Krattenthaler and Toufik Mansour. Counting triangulations of balanced subdivisions of convex polygons Sergio Cabello and Miha Jejčič. Refining the Hierarchies of Classes of Geometric Intersection Graphs
11:30-11:40 Short break
11:40-12:00 Mucuy-Kak Guevara, Camino Balbuena and Hortensia Galeana-Sanchez. Relation between number of kernels (and some else) of a digraph and its partial line digraphs M. José Jiménez and Andrés M. Encinas. Combinatorial Recurrences and Linear Difference Equations
12:00-12:20 Josep Fàbrega, Jaume Martí-Farré and Xavier Muñoz.  Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing Yonah Biers-Ariel, Anant Godbole and Yiguang Zhang. Preferential Arrangement Superpatterns
12:30-14:00 LUNCH