2019-12-16 10:00 — 11:00 FAMNIT-MP1 Miklós Krész (INNORENEW COE and UP IAM) Maximally-Matchable Edges, Decomposition Theory and Parameterized Complexity In matching theory it is a basic problem to determine all the edges in a given graph which can be extended…
2019-12-09 10:00 — 11:00 FAMNIT-MP1 Clément Dallard (UP FAMNIT) Proportionally Dense Subgraphs of Maximum Size. The notion of density of a subgraph is usually defined as the number of edges in the subgraph divided by the number of its vertices.…
2019-12-02 10:00 — 11:00 FAMNIT-MP1 Madeleine Whybrow (UP FAMNIT) Graded dihedral axial algebras Axial algebras are non-associative algebras generated by semisimple idempotents, known as axes, whose eigenvectors obey a given fusion law. These algebras have been shown to occur in…
2019-11-25 10:00 — 11:00 FAMNIT-MP1 Micael Toledo (IMFM – UP FAMNIT, Slovenia) Generalised voltage graphs. Given a graph X and a group G we may construct a covering graph Cov(X,Z) by means of a function (called a voltage assignment) Z,…
2019-11-18 10:00 — 11:00 FAMNIT-MP1 Michiel Van Couwenberghe (Ghent University, Belgium). Modules over axial algebras Axial algebras are a recently defined type of nonassociative algebras. They are primarily used to realize groups inside the automorphism group of such an algebra.…
2019-11-11 10:00 — 11:00 FAMNIT-MP1 Jose Alejandro Samper (MPI-MIS Leipzig, Germany) Shellings of polytopes and matroid independence complexes. Matroids are combinatorial objects designed to capture essential features of the notion of (linear) independence. They show up naturally in several contexts,…
2019-11-04 10:00 — 11:00 FAMNIT–MP1 Robert Jajcay (Comenius University, Bratislava, Slovakia) Bipartite Biregular Cages and Block Designs A bipartite biregular (n,m;g)-graph G is a bipartite graph of even girth g having the degree set {n,m} and satisfying the additional property…
2019-10-28 10:00 — 11:00 FAMNIT-MP1 Nevena Pivač (UP FAMNIT – UP IAM) A dichotomy for tame graph classes defined by small forbidden induced subgraphs Given a graph G, a minimal separator in G is a subset of vertices that separates…
2019-10-08 11:15–15:00 FAMNIT-VP1 Martin R Bridson, Maria J. Esteban and Volker Mehrmann Start Experiencing 8ECM 11:15 – 12:00: FAMNIT-VP1 Lecturer: Martin R Bridson FRS, 8ECM Prize Committee Chair (University of Oxford) Title: Hyperbolic geometry: where battered gems retain their full beauty Abstract: Hyperbolic…
2019-10-14 10:00 — 11:00 FAMNIT-MP1 Ted Dobson (UP FAMNIT) Recognizing vertex-transitive graphs which are wreath products It is known that a Cayley digraph Cay(A, S) of an abelian group A is isomorphic to a nontrivial wreath product if and only…