Seminár z algebraickej teórie grafov - Štefánia Glevitzká (26.4.2024)

v piatok 26.4.2024 o 13:00 hod. v posluchárni M IX aj online

24. 04. 2024 13.32 hod.
Od: Martin Mačaj

Prednášajúci: Štefánia Glevitzká

Názov: Estimation of vertex-transitive numbers for simple graphs

Termín: 26.4.2024, 13:00 hod., M IX a MS Teams 

A vertex-transitive closure of a graph G is a vertex-transitive supergraph of G on the same vertex set. The vertex-transitive number of G is the smallest possible degree of its vertex-transitive closure. In this talk, we present a lower bound on vertex-transitive numbers for a subclass of polarity graphs. We also classify graphs with various relatively small numbers of edges and a unique vertex-transitive closure. In addition, we identify an infinite family of asymmetric graphs whose vertex-transitive closures can be obtained by adding a single edge. For each of these results, we also provide a sketch of the proof.

Those of you who are not able to attend in person or who are still uncertain about the safety of attending in person are welcome to attend via MS Teams. In either case, we hope to see as many of you as possible (either in person or virtually) at our Friday gatherings.