Title	Ramsey arrows for graphs
Creator	Gunderson, David S.
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2015-11-12T17:10
Description	A simple form of Ramsey's theorem says that for any positive integer $m$, there exists an $n=R(m)$ so that no matter how the pairs of an $n$-set are partitioned into two colours, some $m$-subset has all its pairs the same colour. In terms of graphs, this says if the edges of a $K_n$ are 2-coloured, a monochromatic copy of $K_m$ (as a subgraph) can always be found. Such a statement is often expressed in ``Ramsey arrow'' notation. A short survey of Ramsey arrows for graphs is given, culminating in a characterization found with Rodl and Sauer of those triples $G,H,r$ for which there is an $F$ that arrows $G$ when colouring $H$s with $r$ colours.
Extent	26 minutes
Subject	Mathematics; Combinatorics; Dynamical systems and ergodic theory; Logic and foundations
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Manitoba
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2016-05-14
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0302688
URI	http://hdl.handle.net/2429/58143
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