Ramsey theory is based on Ramsey's theorem, because without it, there would be no Ramsey numbers, since they are not well-defined. This is part 2 of the trilogy of the Ramsey numbers. Useful link: https://en.wikipedia.org/wiki/Ramsey%27s_theorem#2-colour_case Other than commenting on the
From playlist Ramsey trilogy
Advances on Ramsey numbers - Jacob Fox
https://www.math.ias.edu/seminars/abstract?event=83564
From playlist Computer Science/Discrete Mathematics
Ramsey theorems for classes of structures with (...) - J. Hubička - Workshop 1 - CEB T1 2018
Jan Hubička (Charles U) / 02.02.2018 Ramsey theorems for classes of structures with functions and relations We discuss a generalization of Nešetřil-Rődl theorem for free amalgamation classes of structures in a language containing both relations and partial functions. Then we further stre
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
Steven Charlton: Bowman Bradley type relations for symmetrized multiple zeta values
The lecture was held within the framework of the Hausdorff Trimester Program: Periods in Number Theory, Algebraic Geometry and Physics.
From playlist HIM Lectures: Trimester Program "Periods in Number Theory, Algebraic Geometry and Physics"
Ramsey classes and sparsity for finite models - J. Nešetřil - Workshop 1 - CEB T1 2018
Jaroslav Nešetřil (Prague) / 31.01.2018 In the talk we relate two notions in the title particularly in the context of sparse dense dichotomy (nowhere and somewhere dense classes and stability) and Ramsey classes of finite models in the context of the characterisation programme. A joint wo
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
Ramsey Theory for Metric Spaces - Manor Mendel
Manor Mendel The Open University of Israel; Member, School of Mathematics February 5, 2013 For more videos, visit http://video.ias.edu
From playlist Mathematics
J. Nesetril: Towards Characterization of Ramsey classes
J. Nesetrils lecture was held within the framework of the Hausdorff Trimester Program Universality and Homogeneity during the workshop on Homogeneous Structures (31.10.2013)
From playlist HIM Lectures: Trimester Program "Universality and Homogeneity"
This video is about some of the basic properties of Ramsey numbers.
From playlist Basics: Graph Theory
Automorphism groups and Ramsey properties of sparse graphs - D. Evans - Workshop 1 - CEB T1 2018
David Evans (Imperial) / 30.01.2018 An infinite graph is sparse if there is a positive integer k such that for every finite subgraph, the number of edges is bounded above by k times the number of vertices. Such graphs arise in model theory via Hrushovskis predimension constructions. In jo
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
Due to the COVID-19 pandemic, Carnegie Mellon University is protecting the health and safety of its community by holding all large classes online. People from outside Carnegie Mellon University are welcome to tune in to see how the class is taught, but unfortunately Prof. Loh will not be o
From playlist CMU 21-228 Discrete Mathematics
MIT 8.421 Atomic and Optical Physics I, Spring 2014 View the complete course: http://ocw.mit.edu/8-421S14 Instructor: Wolfgang Ketterle In this lecture, the professor used simple cases to explain line shifts and broadening. License: Creative Commons BY-NC-SA More information at http://oc
From playlist MIT 8.421 Atomic and Optical Physics I, Spring 2014
Extremal Combinatorics with Po-Shen Loh 03/30 Mon
Carnegie Mellon University is protecting the community from the COVID-19 pandemic by running courses online for the Spring 2020 semester. This is the video stream for Po-Shen Loh’s PhD-level course 21-738 Extremal Combinatorics. Professor Loh will not be able to respond to questions or com
From playlist CMU PhD-Level Course 21-738 Extremal Combinatorics
Natasha Dobrinen: Borel sets of Rado graphs are Ramsey
The Galvin-Prikry theorem states that Borel partitions of the Baire space are Ramsey. Thus, given any Borel subset $\chi$ of the Baire space and an infinite set $N$, there is an infinite subset $M$ of $N$ such that $\left [M \right ]^{\omega }$ is either contained in $\chi$ or disjoint fr
From playlist Combinatorics
Amanda Montejano: Zero-sum squares in bounded discrepancy {-1,1}-matrices
A square in a matrix $\mathcal M =(a_{ij})$ is a 2X2 sub-matrix of $\mathcal M$ with entries $a_{ij}, a_{i+s,j}, ai,j+s, a_{i+s,j+s}$s for some $s\geq 1$. An Erickson matrix is a square binary matrix that contains no squares with constant entries. In [Eri96], Erickson asked for the maximum
From playlist Virtual Conference
Dependent random choice - Jacob Fox
Marston Morse Lectures Topic: Dependent random choice Speaker: Jacob Fox, Stanford University Date: October 26, 2016 For more videos, visit http://video.ias.edu
From playlist Mathematics
Metrizable universal minimal flows and Ramsey theory - T. Tsankov - Workshop 1 - CEB T1 2018
Todor Tsankov (Université Paris Diderot) / 01.02.2018 The connection between Ramsey theory and topological dynamics goes back at least to Furstenberg who used dynamical systems of the group of integers to derive a new proof of Van Der Waerden’s theorem. More recently, Kechris, Pestov, and
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
The absorption method, and an application to an old Ramsey problem - Matija Bucic
Computer Science/Discrete Mathematics Seminar II Topic: The absorption method, and an application to an old Ramsey problem Speaker: Matija Bucic Affiliation: Veblen Research Instructor, School of Mathematics Date: March 29, 2022 The absorption method is a very simple yet surprisingly pow
From playlist Mathematics