Extremal graph theory

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

2 Direct Graphs

Introduction to graph theory. Directed and undirected graph

From playlist Graph Theory

Graph Theory: 09. Graph Isomorphisms

In this video I provide the definition of what it means for two graphs to be isomorphic. I illustrate this with two isomorphic graphs by giving an isomorphism between them, and conclude by discussing what it means for a mapping to be a bijection. An introduction to Graph Theory by Dr. Sar

From playlist Graph Theory part-2

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: 05. Connected and Regular Graphs

We give the definition of a connected graph and give examples of connected and disconnected graphs. We also discuss the concepts of the neighbourhood of a vertex and the degree of a vertex. This allows us to define a regular graph, and we give some examples of these. --An introduction to

From playlist Graph Theory part-1

What is a Graph? | Graph Theory

What is a graph? A graph theory graph, in particular, is the subject of discussion today. In graph theory, a graph is an ordered pair consisting of a vertex set, then an edge set. Graphs are often represented as diagrams, with dots representing vertices, and lines representing edges. Each

From playlist Graph Theory

Extremal theory of ordered graphs – Gábor Tardos – ICM2018

Combinatorics Invited Lecture 13.3 Extremal theory of ordered graphs Gábor Tardos Abstract: We call simple graphs with a linear order on the vertices ‘ordered graphs’. Turán-type extremal graph theory naturally extends to ordered graphs. This is a survey on the ongoing research in the ex

From playlist Combinatorics

Graph Theory: 10. Isomorphic and Non-Isomorphic Graphs

Here I provide two examples of determining when two graphs are isomorphic. If they are isomorphic, I give an isomorphism; if they are not, I describe a property that I show occurs in only one of the two graphs. Here is a related video in which I show how to check for whether these examp

From playlist Graph Theory part-2

What is a Bipartite Graph? | Graph Theory

What is a bipartite graph? We go over it in today’s lesson! I find all of these different types of graphs very interesting, so I hope you will enjoy this lesson. A bipartite graph is any graph whose vertex set can be partitioned into two disjoint sets (called partite sets), such that all e

From playlist Graph Theory

Exploratory Graphs part 1 HD 720p

From playlist Exploratory Data Analysis

The Abel lectures: László Lovász and Avi Wigderson

0:30 Introduction by the Abel Prize Committee Chair, Hans Munthe-Kaas 02:42 László Lovász: Continuous limits of finite structures 49:27 Questions and answers 1:00:31 Avi Wigderson: The Value of Errors in Proofs 1:41:24 Questions and answers 1:50:20 Final remarks by John Grue, Chair of the

From playlist Abel Lectures

8ECM Abel Lecture: László Lovász

From playlist 𝙋𝙧𝙞𝙯𝙚 𝙇𝙚𝙘𝙩𝙪𝙧𝙚𝙨

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

A glimpse of continuous combinatorics via natural quasirandomness - Leonardo Coregliano

Short Talks by Postdoctoral Members Topic: A glimpse of continuous combinatorics via natural quasirandomness Speaker: Leonardo Coregliano Affiliation: Member, School of Mathematics Date: September 23, 2021

From playlist Mathematics

Matas Sileikis & Lutz Warnke

From playlist Contributed talks One World Symposium 2020

Rafał Kulik: Blocks estimators in Extreme Value Theory

Rafał Kulik, University of Ottawa 10 November 2022 Abstract: Extreme value theory deals with large values and rare events. These large values tend to cluster in case of temporal dependence. This clustering behaviour is widely observed in practice. I will start with a mild introduction to

From playlist SMRI Seminars

3. Forbidding a subgraph II: complete bipartite subgraph

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX What is the maximum number of edges in a graph forbidding

From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019

Old and New Results on the Spread of the Spectrum of a Graph - John C Urschel

The spread of a matrix is defined as the diameter of its spectrum. This quantity has been well-studied for general matrices and has recently grown in popularity for the specific case of the adjacency matrix of a graph. Most notably, Gregory, Herkowitz, and Kirkland proved a number of key r

From playlist Mathematics

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

Avi Wigderson & László Lovász - The Abel Prize interview 2021

00:30 Interview start 01:03 On the place of discrete math and theoretical computer science 08:14 Turing and Hilbert 14:28 P vs NP problem, what is it and why is it important? 25:09 Youth in Haifa, Avi Wigderson 30:09 Youth in Budapest, László Lovász 37:45 Problem solver or theory builde

From playlist László Lovász