Shoham Letzter: Decomposing cubic graphs into isomorphic linear forests

(1:44)

Shoham Letzter: \

(1:22:59)

Size-Ramsey numbers of powers of tight paths - Shoham Letzter (UCL)

(58:50)

Shoham Letzter (UCL), An improvement on Łuczak's connected matchings method, 3rd November 2020

(54:23)

Shoham Letzter - \

(33:34)

Shoham Letzter: Monochromatic triangle packings in 2-coloured complete graphs

(55:41)

Finding monotone patterns in sublinear time

(19:44)

L. Yepremyan \

(51:50)

NAHARIYA City, Virtual Video Walk

(1:2:30)

Introduction to Hypergraphs [Graph Theory]

(15:44)

R8. NP-Complete Problems

(45:47)

Graph Theory 8: Four Color Theorem (Kempe's Proof)

(17:57)

Theorem - Maximum Number of Edges in Simple Graph is n(n-1)/2 | By :- Harendra Sharma

(12:13)

a graph theory proof: Ramsey theory

(8:20)

Tour of UCL | University College London

(3:28)

Ramsey Theory Introduction

(6:14)

Ramsey Theory 3: Ramsey Numbers and Ramsey's Theorem

(13:59)

Ramsey Theory in the IMO | International Mathematical Olympiad 1978 Problem 6

(21:35)

22.11.29, Jozef Skokan,Graphs with large minimum degree and no small odd cycles are three-colourable

(42:25)

19/02/2021 - Paul Shafer, \

(1:2:55)

Bulgaria - bicycle ride 2 - Thomas \u0026 Shoham

(22)

Alan Sokal (University College, London and NYU)

(1:30:6)

Eric Rowland, Avoiding fractional powers on an infinite alphabet

(56:)

SiGMa 2017 O-joung Kwon, Chi-boundedness of graph classes excluding wheel vertex-minors

(26:17)

Sophie Spirkl: \

(52:28)

Deepak Bal (Montclair State University), Size Ramsey numbers of paths and cycles

(43:30)

A challenging question to many: Monochromatic triangles in edge-coloring (Graph Theory)

(6:15)

An Application of the Universality Theorem for Tverberg Partitions - Imre Barany

(1:1:22)