Program

8:00-9:00

REGISTRATION

9:00-9:15

OPENING OF THE CONFERENCE by the Rector of the University of Seville

(Main Room: “Salón de Grados”)

9:15-10:15

Invited talk: Sergio Cabello

Interactions between geometry and graphs

(Main Room: “Salón de Grados”)

10:15-10:45

COFFEE BREAK

ROOM A1.10

ROOM A1.14

10:45-11:45

Tobias Müller and Marc Noy. The first order convergence law fails for random perfect graphs 

David Grynkiewicz. Iterated Sumsets and Olson’s Generalization of the Erdos-Ginzburg-Ziv Theorem 

Jie Han, Yoshiharu Kohayakawa, and Yury Person.  Near-perfect clique-factors in sparse pseudorandom graphs 

Marthe Bonamy, Nicolas Bousquet, and Guillem Perarnau. Frozen colourings of bounded degree graphs

Pietro Codara and Ottavio M. D’Antona. Dyck-Eulerian digraphs

Mario Huicochea. Sums of finite subsets in R^d

11:45-12:00

SHORT BREAK

ROOM A1.10

ROOM A1.14

12:00-13:00

Jesús Lacalle and Luis Miguel Pozo Coronado. Variance of the sum of independent random variables in spheres 

Atsuhiro Nakamoto, Gen Kawatani, Naoki Matsumoto, and Jorge Urrutia.  Geometric quadrangulations on a polygon

Bart Litjens, Sven Polak, Bart Sevenster, and Lluís Vena. On the chromatic number of a subgraph of the Kneser graph 

Konstantinos Papalamprou. On characterizing the extreme points of the generalized transitive tournament polytope 

Jan Bok and Jaroslav Nešetřil. Graph-indexed random walks on pseudotrees

Elena Cabrera, María José Chávez, and Alberto Márquez. The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application

13:00-14:30

LUNCH

14:30-15:30

Invited talk: Julia Wolf

 Recent developments in graph and arithmetic regularity

(Main Room: “Salón de Grados”) 

15:30-16:00

COFFEE BREAK

16:00-16:30

POSTER SESSION

ROOM A1.10

ROOM A1.14

16:30-17:10

Simeon Ball and Bence Csajbók. On Segre’s Lemma of Tangents 

Eiran Danan, Raúl Falcón, Dani Kotlar, Trent Marbach, and Rebecca Stones. Two-line graphs of partial Latin 

Javier Cilleruelo, Oriol Serra, and Maximilian Wötzel. Set systems with distinct sumsets

Andrew Vince and Michael Barnsley. Self-Similar Polygonal Tiling

9:00-10:00

Invited talk: Albert Atserias

Limits of Linear and Semidefinite Relaxations for Combinatorial Problems

(Main Room: “Salón de Grados”) 

10:00-10:30

COFFEE BREAK

ROOM A1.10

ROOM A1.14

10:30-11:30

Alfredo Hubard and Arnau Padrol. Stabbing convex subdivisions with k-flats 

Rocío González-Díaz, Miguel A. Gutiérrez-Naranjo, and Eduardo Paluzo-Hidalgo. Representative datasets for neural networks

Guillermo Esteban, Clemens Huemer, and Rodrigo Silveira. New results on production matrices for geometric graphs 

Nieves Atienza, Rocío González-Díaz, and Manuel Soriano-Trigueros. A new entropy based summary function for topological data analysis 

Rui Duarte and António Guedes de Oliveira. Hyperplane arrangements: between Shi and Ish

Alberto Espuny Díaz and Oriol Serra. Entropy versions of additive inequalities 

11:30-11:45

SHORT BREAK

ROOM A1.10

ROOM A1.14

11:45-12:45

Juanjo Rué and Christoph Spiegel. On a problem of Sárközy and Sós for multivariate linear forms

Luis Boza, M. Pastora Revuelta, and M. Isabel Sanz. A general lower bound on the weak Schur number 

José Aliste-Prieto, José Zamora and Anna de Mier. On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs 

Xavier Molinero, Fabián Riquelme, and María Serna. Satisfaction and Power in Unanimous Majority Influence Decision Models 

Mariusz Grech and Andrzej Kisielewicz. 2-closed abelian permutation groups

Víctor Álvarez, José Andrés Armario, María Dolores Frau, Félix Gudiel, María Belén Güemes, Elena Martín and Amparo Osuna. GA Based Robust Blind Digital Watermarking

12:45-13:00

GROUP PHOTO

13:00-14:30

LUNCH

ROOM A1.10

ROOM A1.14

14:30-15:30

Silvia Gago. Kirchhoff index of the connections of two networks by an edge 

Carlos Marijuán and Miriam Pisonero. On spectra of weighted graphs of order $\leq 5$

Óscar Iglesias-Valiño and Francisco Santos. The complete classification of empty lattice 4-simplices

Yulia Kempner and Vadim Levit. Krein-Krein-Milman Spaces 

Javier Rodrigo and Mª Dolores López. An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points

Juanjo Rué, Dimitrios Thilikos, and Vasiliki Velona. Structure and Enumeration of K4-free links and link diagrams

15:30-16:00

COFFEE BREAK

16:00-17:00

BUSINESS MEETING

18:30-19:30

VISIT to “El Alcázar”

20:30

CONFERENCE DINNER at “Río Grande” 

09:30-10:30

Invited talk: Andrea Scozzari

Uniform partition of graphs: Complexity results, algorithms and formulations

(Main Room: “Salón de Grados”) 

10:30-11:00

COFFEE BREAK

ROOM A1.10

ROOM A1.14

11:00-12:00

Encarnación Abajo, Camino Balbuena, and Manuel Bendala. Elliptic semiplanes and regular graphs with girth 5 

Vadim Levit and Eugen Mandrescu. Graph Operations Preserving W2-Property

Aida Abiad. A characterization of weight-regular partitions of graphs 

Santiago Canales, Irene Castro, and Gregorio Hernández. Combinatorial bounds on paired and multiple domination in triangulations 

Pedro Martín and Diego Yáñez. Some clustering algorithms in normed planes

Gonzalo Fiz Pontiveros, Roman Glebov, and Ilan Karpas. Virtually Fibering Random Right-Angled Coxeter Groups

12:00-12:10

SHORT BREAK

ROOM A1.10

ROOM A1.14

12:10-12:50

Shunsuke Nakamura, Yoshimi Egawa, and Keiko Kotani. Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph 

Justo Puerto, Federica Ricca, and Andrea Scozzari. Some results on the reliability of multiple path-shaped facility location on networks 

Mariusz Grech and Andrzej Kisielewicz. Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs

Justo Puerto and Moisés Rodríguez-Madrena. A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric

12:50-14:30

LUNCH