2016-03-07 10:00-11:00 FAMNIT-POŠTA Tatiana Romina Hartinger (UP IAM, UP FAMNIT) 1-perfectly orientable graphs and graph products A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex…
2016-02-29 10:00-11:00 FAMNIT-POŠTA Safet Penjić (UP IAM) On the Terwilliger algebra of bipartite distance-regular graphs with \Delta_2=0 and c_2=2 Let \Gamma denote a bipartite distance-regular graph with diameter D \ge 4 and valency k \ge 4. Let X denote the…
2016-02-22 10:00-11:00 FAMNIT-POŠTA Janoš Vidali (University of Ljubljana) DiscreteZOO – a repository of graphs and its companion Sage package DiscreteZOO is a project combining a central repository of graphs, its website front-end and extensions for software packages like Sage. The…
2016-01-18 10:00-11:00 FAMNIT-POŠTA Bojan Kuzma (UP FAMNIT) Some problems from recent IMAGE We will present solutions to several problems published in recent volume of ILAS publication IMAGE. Problems are intended to popularize the field of Linear algebra.
2016-01-11 10:00-11:00 FAMNIT-POŠTA Tomaž Pisanski (University of Primorska, Slovenia) Operations on maniplexes and oriented maniplexes In the past we have been using flag graphs and symmetry type graphs for studying certain operations on maps and their symmetries, such as truncation,…
2016-01-04 10:00-11:00 FAMNIT-POŠTA Gordon Williams (University of Alaska Fairbanks, USA) Monodromy groups and regular covers of abstract polytopes The objective of this talk is to provide an introduction to several open problems about the monodromy groups of abstract polytopes and…
2015-12-21 10:00-11:00 FAMNIT-POŠTA Russ Woodroofe (Mississippi State University, USA) Lattice labelings and modular elements This talk will be about finite lattices and posets. I’ll tell you what an EL-labeling is, explain how the subgroup lattice of a supersolvable group motivates…
2015-12-14 10:00-11:00 FAMNIT-POŠTA Ademir Hujdurović (UP IAM, UP FAMNIT) Localizable graphs A clique in a graph is said to be strong if it intersects every maximal stable set. A graph is called localizable if it admits a partition of its…
2015-12-07 10:00-11:00 FAMNIT-POŠTA Robert Jajcay (UP FAMNIT and Comenius University (Slovakia)) Half-regular Cayley maps A Cayley map M=CM(G,X,P) is an embedding of a Cayley graph C(G,X) in an orientable surface with the property that each left multiplication by an element…