Seminár z teoretickej informatiky - Jorik Jooken (15.3.2024)

v piatok 15.3.2024 o 11:00 hod. v miestnosti F 108

11. 03. 2024 19.47 hod.
Od: Rastislav Královič

Prednášajúci: Jorik Jooken (Katholieke Universiteit, Leuven)

Názov: Computational bounds for the minimum order of an edge-girth-regular graph

Termín: 15.3.2024, 11:00 hod., F 108

Abstrakt:
An edge-girth-regular(v,k,g,lambda) graph is a k-regular graph of order v and girth g such that each edge is contained in precisely lambda girth cycles. These graphs generalize several well known classes of graphs such as edge-regular graphs, edge-transitive graphs and arc-transitive graphs. In this seminar, we discuss an algorithm to exhaustively generate all edge-girth-regular graphs of a fixed order and improve several bounds on the minimum order of these graphs for certain tuples (k,g,lambda). In this seminar, we will also discuss implementation aspects that are not described in the paper. Full paper: https://arxiv.org/pdf/2401.08271.pdf