|
8:45-9:45
|
Incidence bounds over rational points
Jozsef
Solymosi
|
|
9:45-10:15
|
Coffee
break
|
|
|
lecture
room A
|
lecture
room B
|
lecture
room C
|
|
10:15-10:35
|
A minimum degree condition forcing a digraph to be
k-linked
Deryk
Osthus and Daniela Kühn
|
NP for combinatorists
Gábor
Kun and Jaroslav Nešetřil
|
An approximate version of the Loebl-Komlós-Sós
conjecture
Diana
Piguet and Maya Stein
|
|
10:35-10:55
|
Circular-imperfection of triangle-free graphs
Jens
Kuhpfahl, Annegret K. Wagler and Christian Wagner
|
Partial Satisfaction of k-Satisfiable Formulas
Dominik
Scheder and Claudia Käppeli
|
Detecting induced subgraphs
Benjamin
Lévêque, David Y. Lin, Frédéric Maffray and Nicolas Trotignon
|
|
10:55-11:15
|
Graph classes with given 3-connected components:
asymptotic counting and critical phenomena
Omer
Giménez, Marc Noy and Juan José Rué
|
Sets of Gaps in Sequences of Frobenius' Problems
with 3 Elements
Francesc
Aguiló-Gost
|
Induced trees in triangle-free graphs
Robert
Šámal and Jiří Matoušek
|
|
11:15-11:35
|
The Connectivity of addition Cayley graphs
David
Grynkiewicz, Vsevolod F. Lev and Oriol Serra
|
Generating functions and the solutions of full
history recurrence equations
Minh
Tang
|
On the Cubicity of Interval Graphs
L.
Sunil Chandran, Mathew C. Francis and Naveen Sivadasan
|
|
11:35-12:15
|
Short
break
|
|
12:15-14:30
|
Lunch
|
|
14:30-15:30
|
New perspectives
in graph enumeration
Marc Noy
|
|
15:30-16:00
|
Coffee
break
|
|
|
lecture
room A
|
lecture
room B
|
lecture
room C
|
|
16:00-16:20
|
Spectral and Geometric Properties of k-Walk-Regular
Graphs
Miguel
Angel Fiol and Ernest Garriga
|
Claw-free circular-perfect graphs
Arnaud
Pêcher and Xuding Zhu
|
Feasibility of the Mixed Postman Problem with
Restrictions on the Edges
Francisco
Javier Zaragoza Martínez
|
|
16:20-16:40
|
Bijective combinatorics of positive braids
Marie
Albenque
|
Approximation of 3-Edge-Coloring of Cubic Graphs
Martin
Kochol, Nad’a Krivoňáková, Silvia Smejová and Katarína Šranková
|
Bipartite operator decomposition of graphs and the
reconstruction conjecture
Pavel
V. Skums and Regina I. Tyshkevich
|
|
16:40-17:00
|
Fibonacci polynomials: compositions and cyclic
products
Volker
Strehl
|
Edge-colorings of cubic graphs with elements of
point-transitive Steiner triple systems
Daniel Král’, Edita Máčajová, Attila Pór
and Jean-Sébastien Sereni
|
Hamiltonian fault-tolerance of hypercubes
Tomáš
Dvořák and Petr Gregor
|
|
17:00-17:20
|
Fully Optimal Bases and the Active Bijection in
Graphs, Hyperplane Arrangements and Oriented Matroids
Emeric
Gioan and Michel Las Vergnas
|
|
Two New Classes of Hamiltonian Graphs
Esther
M. Arkin, Joseph S. B. Mitchell and Valentin Polishchuk
|
