Graph Theory: 02. Definition of a Graph
In this video we formally define what a graph is in Graph Theory and explain the concept with an example. In this introductory video, no previous knowledge of Graph Theory will be assumed. --An introduction to Graph Theory by Dr. Sarada Herke. This video is a remake of the "02. Definitio
From playlist Graph Theory part-1
Graph Theory: 03. Examples of Graphs
We provide some basic examples of graphs in Graph Theory. This video will help you to get familiar with the notation and what it represents. We also discuss the idea of adjacent vertices and edges. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https
From playlist Graph Theory part-1
Graph Theory: 31. Lemma on Hamiltonian Graphs
I explain a proof of the following lemma: If a graph G is Hamiltonian, then for every nonempty subset S of the vertices, the number of connected components of the graph G-S is at most the size of S. An introduction to Graph Theory by Dr. Sarada Herke. Related Videos: http://youtu.be/3xeYc
From playlist Graph Theory part-6
What are Connected Graphs? | Graph Theory
What is a connected graph in graph theory? That is the subject of today's math lesson! A connected graph is a graph in which every pair of vertices is connected, which means there exists a path in the graph with those vertices as endpoints. We can think of it this way: if, by traveling acr
From playlist Graph Theory
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
Graph Theory FAQs: 01. More General Graph Definition
In video 02: Definition of a Graph, we defined a (simple) graph as a set of vertices together with a set of edges where the edges are 2-subsets of the vertex set. Notice that this definition does not allow for multiple edges or loops. In general on this channel, we have been discussing o
From playlist Graph Theory FAQs
Measurable equidecompositions – András Máthé – ICM2018
Analysis and Operator Algebras Invited Lecture 8.8 Measurable equidecompositions András Máthé Abstract: The famous Banach–Tarski paradox and Hilbert’s third problem are part of story of paradoxical equidecompositions and invariant finitely additive measures. We review some of the classic
From playlist Analysis & Operator Algebras
Gianluca Paolini: Torsion-free Abelian groups are Borel complete
HYBRID EVENT Recorded during the meeting "XVI International Luminy Workshop in Set Theory" the September 14, 2021 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicia
From playlist Logic and Foundations
Graph Theory: 42. Degree Sequences and Graphical Sequences
Here I describe what a degree sequence is and what makes a sequence graphical. Using some examples I'll describe some obvious necessary conditions (which are not sufficient). Then I explain how a Theorem by Havel and Hakimi gives a necessary and sufficient condition for a sequence of non
From playlist Graph Theory part-8
Marcin Sabok: Perfect matchings in hyperfinite graphings
Recorded during the meeting "XVI International Luminy Workshop in Set Theory" the September 16, 2021 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Au
From playlist Probability and Statistics
Finding the axis of symmetry for a parabola and graph
👉 Learn the basics to understanding graphing quadratics. A quadratic equation is an equation whose highest exponent in the variable(s) is 2. To graph a quadratic equation, we make use of a table of values and the fact that the graph of a quadratic is a parabola which has an axis of symmetr
From playlist Graph a Quadratic in Standard Form | Essentials
(Optional lecture) - Towards a classification of adelic Galois representations of ell. curves (BU)
This is a lecture I gave at Boston University's Number Theory Seminar, on April 5th, 2021, on adelic Galois representations. While not a part of the graduate course on elliptic curves, it is a nice complement to some of the material we have seen on the Tate module.
From playlist An Introduction to the Arithmetic of Elliptic Curves
What is the limit of a sequence of graphs?? | Benjamini-Schramm Convergence
This is an introduction to the mathematical concept of Benjamini-Schramm convergence, which is a type of graph limit theory which works well for sparse graphs. We hope that most of it is understandable by a wide audience with some mathematical background (including some prior exposure to g
From playlist Summer of Math Exposition Youtube Videos
Does Infinite Cardinal Arithmetic Resemble Number Theory? - Menachem Kojman
Menachem Kojman Ben-Gurion University of the Negev; Member, School of Mathematics February 28, 2011 I will survey the development of modern infinite cardinal arithmetic, focusing mainly on S. Shelah's algebraic pcf theory, which was developed in the 1990s to provide upper bounds in infinit
From playlist Mathematics
The role of topology and compactness (...) - CEB T2 2017 - Varadhan - 3/3
S.R.S. Varadhan (Courant Institute) - 09/06/2017 The role of topology and compactness in the theory of large deviations When a large deviation result is proved there is some topology involved in the statement because it affects the class of sets for which the estimates hold. Often the cho
From playlist 2017 - T2 - Stochastic Dynamics out of Equilibrium - CEB Trimester
Mazur's program B. - Zureick-Brown - Workshop 2 - CEB T2 2019
David Zureick-Brown (Emory University, Atlanta USA) / 25.06.2019 Mazur's program B. I’ll discuss recent progress on Mazur’s “Program B” – the problem of classifying all possibilities for the “image of Galois” for an elliptic curve over Q (equivalently, classification of all rational poi
From playlist 2019 - T2 - Reinventing rational points
Graph Theory 37. Which Graphs are Trees
A proof that a graph of order n is a tree if and only if it is has no cycle and has n-1 edges. An introduction to Graph Theory by Dr. Sarada Herke. Related Videos: http://youtu.be/QFQlxtz7f6g - Graph Theory: 36. Definition of a Tree http://youtu.be/Yon2ndGQU5s - Graph Theory: 38. Three
From playlist Graph Theory part-7
Solving a quadratic by graphing
Learn how to graph quadratic inequality. A quadratic inequality is an inequality is an inequality whose highest exponent on its variable is 2. The graph of a quadratic inequality is similar to the graph of a quadratic equation with the region inside or outside the parabola shaded. To grap
From playlist Graph Quadratic Inequality #Quadratics
How to determine the domain and range of a quadratic using its vertex
👉 Learn the basics to understanding graphing quadratics. A quadratic equation is an equation whose highest exponent in the variable(s) is 2. To graph a quadratic equation, we make use of a table of values and the fact that the graph of a quadratic is a parabola which has an axis of symmetr
From playlist Graph a Quadratic in Standard Form | Essentials
(PP 1.8) Measure theory: CDFs and Borel Probability Measures
Correspondence between Borel probability measures on R and CDFs (cumulative distribution functions). A playlist of the Probability Primer series is available here: http://www.youtube.com/view_play_list?p=17567A1A3F5DB5E4 You can skip the measure theory (Section 1) if you're not in
From playlist Probability Theory