Title	Expander graphs both local and global
Creator	Linial, Nathan
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-09-05T09:02
Description	If $v$ is a vertex in a graph $G$ we denote by $G_v$ the subgraph of $G$ induced on $v$â s neighbors. An $(a,b)$ graph is an $a$-regular graph where every $G_v$ is $b$-regular. Q1: For which $a>b>0$ integers do there exist arbitrarily large, connected $(a,b)$-graphs Q2: Can such graphs be very good expanders Q3: What if you require in addition that every $G_v$ be connected Q4: Can you even make every $G_v$ a very good expander In this talk I will provide some answers to these and related questions and still leave much to be considered on this domain. Joint work with Michael Chapman and Yuval Peled
Extent	38.0 minutes
Subject	Mathematics; Combinatorics; Probability theory and stochastic processes
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Hebrew University of Jerusalem
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-03-04
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0388854
URI	http://hdl.handle.net/2429/73672
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos