9Th Slovenian International Conference on Graph Theory, Bled 2019 BLED, SLOVENIA, JUNE 23 – JUNE 29, 2019
Total Page:16
File Type:pdf, Size:1020Kb
9th Slovenian International Conference on Graph Theory, Bled 2019 BLED, SLOVENIA, JUNE 23 – JUNE 29, 2019 PLENARY SPEAKERS: INVITED SPECIAL SESSIONS: Noga Alon (Princeton University, USA and Tel Aviv University, Israel) ASSOCIATION SCHEMES (M. MUZYCHUK) Marco Buratti (University of Perugia, Italy) BIOMATHEMATICS AND BIOINFORMATICS (M. HELLMUTH) Gareth Jones (University of Southampton, UK) CHEMICAL GRAPH THEORY (X. LI) Daniel Král' (Warwick University, UK and Masaryk University, Czech Republic) CONFIGURATIONS (G. GÉVAY) Daniela Kühn (University of Birmingham, UK) DESIGNS (D. CRNKOVIĆ) Gábor Korchmáros (University of Basilicata, Italy) DISCRETE AND COMPUTATIONAL GEOMETRY (S. CABELLO) Sergei Lando (National Research University Higher School of Economics, Russia) DISTANCE-REGULAR GRAPHS (Š. MIKLAVIČ) János Pach (EPFL, Lausanne and Rényi Institute, Hungary) DOMINATION IN GRAPHS (M. HENNING) Cheryl E. Praeger (University of Western Australia, Australia) FINITE GEOMETRIES (T. SZÖNYI) Zsolt Tuza (Rényi Institute and University of Pannonia, Hungary) GAMES ON GRAPHS (CS. BUJTÁS) Xuding Zhu (Zhejiang Normal University, China) GRAPH COLORING (I. SCHIERMEYER) METRIC GRAPH THEORY (I. G. YERO) Scientific Committee: Sandi Klavžar, Dragan Marušič, Bojan Mohar (chair), Tomaž Pisanski POLYTOPES (A. IVIĆ WEISS) Organizing Committee: B. Brešar, S. Cabello, A. Hujdurović, R. Požar SPECTRAL GRAPH THEORY (F. BELLARDO) Organized by IMFM - Institute of Mathematics, Physics and Mechanics STRUCTURAL AND ALGORITHMIC GRAPH THEORY (P. ABOULKER) in collaboration with Abelium d.o.o., DMFA, SDAMS, UL FMF, UM FNM, UP FAMNIT, UP IAM. SYMMETRIES OF GRAPHS AND MAPS (M. CONDER) Rikli balance hotel Arnold Hall (all plenary talks of the day) 08:50 Opening remarks MONDAY, June 24 09:00 DANIEL KRÁL': Profiles of graphs and tournaments 9th Slovenian International Conference on Graph Theory, Bled 2019 09:55 SERGEI LANDO: Integrability property of polynomial graph invariants 10:45 Coffee (Hotel Kompas) Rikli balance hotel Hotel Kompas Hotel Kompas Hotel Lovec Hotel Lovec Hotel Kompas Hotel Kompas Arnold Hall Jezerska Hall Triglavska+Grajska Hall Panorama I Panorama II Blejska Hall Riklijeva Hall SYMMETRIES OF G&M SPECTRAL GT DIST.-REG. GRAPHS GENERAL GT STRUCT. & ALGOR. GT GENERAL GT DESIGNS L. MORGAN: The distingui- M. ANDELIC: Tridiagonal R. F. BAILEY: On distance- G. RÁCZ: Generalized Lah M. KRNC: On the End-Vertex F. HOERSCH: Highly vertex- A. POTT: Homogeneous 11:15 shing number of 2-AT graphs matrices and spectral regular graphs on 486 numbers and their graph connected orientations of and permutation groups properties… vertices theoretical interpretation Problem of Graph Searches regular eulerian graphs cubic bent functions M. PILŚNIAK: Distinguishing A. ABIAD: A characterization A. NEUMAIER: t-point counts G. NYUL: Various generali- N. L. D. SINTIARI: Layered Y. SUZUKI: Partially Broken J. R. SCHMITT: Distinct 11:35 and an application of weight- Orientations of Eulerian colorings of maps regular partitions of graphs in distance-regular graphs zations of Bell numbers wheels Plane Graphs partial sums in cyclic groups R. KALINOWSKI: Symmetry B. MIHAILOVIČ: Some H. SUZUKI: The universal C- G. BACSÓ: The Equal-Sum- M. HECHT: Top. Invariants of I. FABRICI: Circumference of O. OLMEZ: Partial Geometric 11:55 breaking in claw-free graphs examples of transformations cover of a completely regular Free Subset problem Elem. Cycles and a essentially 4-connected Designs and Their Links of small max degree that preserve sgn(λ2-r) clique graph Generalization of Biggs Thm planar graphs 12:15 Lunch (on your own) There should be no such thing 14:30 XUDING ZHU: List colouring and Alon-Tarsi number of planar graphs as boring mathematics 15:20 Coffee (Hotel Kompas) - - - - - - - - - - - - - - - - - - - - Edsger Dijkstra SYMMETRIES OF G&M SPECTRAL GT GENERAL GT GAMES ON GRAPHS STRUCT. & ALGOR. GT GENERAL GT DESIGNS P. POTOČNIK: Generalised A. GAVRILYUK: On the M. DĘBSKI: Edge colorings J. GRYTCZUK: Choosability M. MILANIČ: Avoidable S. CICHACZ: Group distance D. CRNKOVIĆ: Self- 15:50 multiplicities of digraph Vertices, Edges, and Highly orthogonal codes from block voltage graphs eigenvalues avoiding patterns Games Symmetric Graphs magic hypercubes designs and ass. schemes N. POZNANOVIC: Normal C. DALFO: Spectrum and H. FURMAŃCZYK: Equitable É. SOPENA: A connected J. BEISEGEL: Maximum B. K. SAHOO: Vertex R. EGAN: Complementary 16:10 quotients of four-valent G- local spectra of a graph from list vertex colourability and version of the graph Weighted Clique in Hole- connectivity of the power sequences and oriented graphs its regular partitions arboricity of grids coloring game Cyclically Orientable Graphs graph of a finite cyclic group combinatorial structures A. MALNIČ: Covers of T. TANIGUCHI: A generali- M. MACEKOVÁ: Acyclic D. ŠTESL: Indicated coloring E. KIM: Erdős–Pósa Property M. GRECH: Wreath product S. COSTA: Relative Heffter 16:30 coloring of graphs with game on Cartesian products of Chordless Cycles and its of perm. groups as the digraphs zation of Hoffman Graph prescribed max avg degree of graphs Applications autom. group of a graph arrays and biembeddings 16:50 Short break SYMMETRIES OF G&M SPECTRAL GT GENERAL GT GAMES ON GRAPHS STRUCT. & ALGOR. GT GENERAL GT DESIGNS D. CATALANO: Strong map- P. WISSING: The negative A. VESEL: Packing colorings S. DANTAS: The Graceful M. PIZAÑA: Algorithmic S. PAGANI: Discrete tomo- A. WASSERMANN: On q- 17:00 symmetry of SL(3,K) and tetrahedron and … graphs of Sierpiński-type and H Aspects of the Finite graphy: … local uniqueness analogs of group divisible PSL(3,K) for any finite field K determined by H. spectrum graphs Game Extension Problem for two directions designs D. PINTO: Duality and Chiral- A. FARRUGIA: Generating K. ANDO: Some new local D. B. WEST: The Slow- S. ONN: Deciding and B. ŻAK: Determination of the A. PASOTTI: Odd sun 17:20 Pairs of Generalized conditions for k-contractible Optimizing over Degree optimal ship trajectory in a systems of the complete Duality Cospectral Graphs… edges Coloring Game on a Graph Sequences collision situation… graph H. P. LUK: Tilings of the D. LABBATE: Non bipartite G. PULEO: Online Sum- S. HORVÁT: Exact random J. GARUS: Underwater S. BAN: New extremal Type 17:40 Sphere by Almost Equilateral regular 2-factor isomorphic Paintability: Slow-Coloring of sampling of conn. graphs vehicle trajectory planning II Z4-codes of length 32 from Pentagons graphs: an update Trees with a given deg. sequence using the graph theory… Hadamard designs 18:00 End of sessions Reception at the Bled Castle (walk or take a bus departing from Hotel Kompas at 18:10) Rikli balance hotel Arnold Hall (all plenary talks of the day) 09:00 NOGA ALON: Random and quasi-random Cayley sum graphs with applications TUESDAY, June 25 9th Slovenian International Conference 09:55 GARETH A. JONES: Paley, Carlitz and the Paley Graphs on Graph Theory, Bled 2019 10:45 Coffee (Hotel Kompas) Rikli balance hotel Hotel Kompas Hotel Kompas Hotel Lovec Hotel Lovec Hotel Kompas Hotel Kompas Arnold Hall Jezerska Hall Triglavska+Grajska Hall Panorama I Panorama II Blejska Hall Riklijeva Hall POLYTOPES GRAPH COLORING DIST.-REG. GRAPHS GAMES ON GRAPHS GENERAL GT GENERAL GT FINITE GEOMETRIES M. ROSENFELD: Branko I. SCHIERMEYER: Polynomial B. FERNÁNDEZ: On the CS. BUJTÁS: Domination and J. GOEDGEBEUR: Graphs M. HECHT: Tight L. DENAUX: Small weight 11:15 Grünbaum, the mathema- chi-binding functions and Terwilliger Algebra of Locally transversal games: Localisations of Minimial code words from incidence tician who beat the odds forbidden ind. subgraphs Pseudo-DRG Conjectures and perfectness with few Hamiltonian Cycles Feedback Sets in Cubic Time of points and hyperplanes… A. I. WEISS: Realizations of D. RALL: Packing chromatic S. PENJIĆ: A comb. approach V. IRŠIČ: Some results on the J. ZERAFA: Hamiltonian G. Y. KATONA: Complexity S. ADRIAENSEN: … Small 11:35 regular abstract polytopes in to the Terwilliger algebra cycles containing a questions for minimally t- Weight Code Words of euclidean spaces vertex-critical graphs modules of a bipartite DRG connected domination game prescribed perfect matching tough graphs Projective Geometric Codes D. LEEMANS: Rank reduction J. FERME: Graphs that are Š. MIKLAVIČ: Irreducible T- T. JAMES: Domination game D. MATTIOLO: Upper and G. KUBICKI: An optimal F. IHRINGER: New SDP 11:55 of string C-group critical for the packing modules with endpoint 1 of lower bounds on the circular algorithm for stopping on representations chromatic number almost 1-homogeneous DRG on split graphs flow number of snarks the element closest to … Bounds on Subspace Codes 12:15 Lunch (on your own) 14:30 DANIELA KÜHN: Resolution of the Oberwolfach problem Beauty can be perceived but not explained. - - - - - - - - - - - - - - - - - - - - - Arthur Cayley 15:20 Coffee (Hotel Kompas) POLYTOPES GRAPH COLORING SPECTRAL GT DOMINATION IN GRAPHS DISC. COMP. GEOMETRY STRUCT. & ALGOR. GT DESIGNS I. HUBARD: Geometric chiral M. ANHOLCER: Majority Z. STANIČ: Notes on spectra S. KLAVŽAR: The Maker- D. PÁLVÖLGYI: T. HUYNH: Unavoidable V. KABANOV: Deza graphs 15:50 polyhedra in 3-dimensional coloring of infinite digraphs of signed graphs Breaker domination game Polychromatic coloring of minors for graphs with large with parameters (v,k,k-2,a) spaces geometric hypergraphs lp-dimension J. BRACHO: A family of finite B. LUŽAR: Homogeneous M. BRUNETTI: On Some T. GOLOGRANC: On graphs M. SAUMELL: Hamiltonicity N. PIVAČ: Minimal separa- F. MEROLA: Cycle systems of 16:10