Title	The costs of symmetry breaking vertex-transitive cubic graphs
Creator	Lachmann, Thomas
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-09-19T09:49
Description	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.
Extent	31.0
Subject	Mathematics; Combinatorics; Group theory and generalizations; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Technische Universität Graz
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-03-19
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377131
URI	http://hdl.handle.net/2429/68911
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Graduate
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos