MAIN

PARTICIPANTS

PROGRAM

ABSTRACTS

INFORMATION

INFORMATION

Program schedule

All talks take place at Sobolev Institute of Mathematics, Seminar room 220. Timetable is subject to change.

September 24 2014

09:45 - 10:00 Official Welcome

Plenary Talks

10:00 - 10:50 D. Krotov: Linear perfect codes in Doob graphs
11:00 - 11:50 N. Dolbilin: Combinatorics of polyhedra
12:00 - 12:20 Coffee break
12:30 - 13:20 A. Vasil'ev: Schur rings and Cayley schemes of finite non-abelian groups
13:30 - 15:45 Lunch
16:00 - 16:50 S. Lando: On the signed number circuits of even length in nonoriented graphs

Contributed Talks

17:00 - 17:20 Goryainov: On the Deza graphs with disconnected second neighbourhood
17:30 - 17:50 I. Estélyi: On groups all of whose undirected Cayley graphs of bounded valency are integral
18:00 - 18:20 E. Khomyakova: On multiplicities of eigenvalues of the Star graphs

September 25 2014

Plenary Talks

10:00 - 10:50 T. Pisanski: Some statistics on small connected trivalent vertex-transitive graphs
11:00 - 11:50 A. Malnič: Algorithmic aspects related to the structure of lifted groups along covering projections
12:00 - 12:20 Coffee break
12:30 - 13:20 A. Mednykh: Automorphism groups and branched coverings of graphs
13:30 - 15:45 Lunch

Contributed Talks

16:00 - 16:20 N. Abrosimov: Volumes of polyhedra with symmetries
16:30 - 16:50 I. Mednykh: On isospectrality of genus two graphs
17:00 - 17:20 E. Uharova: On isospectrality of genus three graphs
17:30 - 17:50 M. Limonov: On graphs with automorphism groups admitting a partition
18:00 - 18:20 T. Lavshuk: Polygons and polyhedra over finite field

September 26 2014

Plenary Talks

10:00 - 10:50 K. Kutnar: On arc-transitive bicirculants
11:00 - 11:50 I. Kovács: On elementary abelian p-groups which are CI-groups
12:00 - 12:20 Coffee break
12:30 - 13:20 A. Gaifullin: Combinatorial realization of cycles and Coxeter groups
13:30 - 13:45 Conference photo (stairs on the entrance of the Sobolev Institute of Mathematics)
14:45 - 15:45 Lunch
16:00 - 16:50 N. Tokareva: Connections between graph theory and cryptography
17:00 - 17:50 A. Kostochka: Many cycle lengths in triangle-free graphs with high chromatic number
18:00 - 18:15 Closing

©Logo design by V.Stefoglo
©Web design by K.Rogalskaya

Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences MMF NSU UP FAMNIT Novosibirsk State University Slovenian Research Agency