BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

The costs of symmetry breaking vertex-transitive cubic graphs Lachmann, Thomas


All but four finite vertex-transitive cubic graphs are $2$-distinguishable. We discuss the corresponding amount, resp. density, of points needed to break all the symmetries for the latter ones. This will be done by splitting the problem into three cases depending on the number of edge orbits the graph has. In the cases of one or three edge orbits the number needed is always finite. The talk will be focused on the case of two edge orbits which will prove to be a bit more diverse.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International