Title	Distinguishing number of vertex-transitive graphs of valency 4
Creator	Verret, Gabriel
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-09-17T12:00
Description	Apart from finitely many exceptions, connected vertex-transitive graphs of valency at most 3 have distinguishing number 2. Recently, Florian Lehner and I determined the distinguishing number of all vertex-transitive graphs of valency 4. In this case, there are infinitely many examples with distinguishing number 3. I will discuss this recent work, as well as some intriguing related questions.
Extent	15.0
Subject	Mathematics; Combinatorics; Group theory and generalizations; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Auckland
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-03-17
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377011
URI	http://hdl.handle.net/2429/68824
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos