Title	Distinguishing numbers of infinite graphs with bounded degrees
Creator	Lehner, Florian
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-09-17T11:00
Description	A graph is said to have infinite motion, if every automorphism moves infinitely many vertices. Tucker's Infinite Motion Conjecture asserts that if a locally finite graph has infinite motion, then there is a 2-colouring of its vertex set which is only preserved by the identity automorphism. We show that this is true for graphs whose maximum degree is at most 5. In case the maximum degree is 3, we can even drop the assumption of infinite motion. Coauthors: M. Pilsniak, M. Stawiski
Extent	41.0
Subject	Mathematics; Combinatorics; Group theory and generalizations; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Warwick
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.0377010
URI	http://hdl.handle.net/2429/68823
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos