Graph theorists

Tibor Gallai

Tibor Gallai (born Tibor Grünwald, 15 July 1912 – 2 January 1992) was a Hungarian mathematician. He worked in combinatorics, especially in graph theory, and was a lifelong friend and collaborator of Paul Erdős. He was a student of Dénes Kőnig and an advisor of László Lovász. He was a corresponding member of the Hungarian Academy of Sciences (1991). (Wikipedia).

Video thumbnail

The BuShou of HanZi :田

A brief description of the BuShou of 田.

From playlist The BuShou of HanZi

Video thumbnail

16. The Great War, Grief, and Memory (Guest Lecture by Bruno Cabanes)

France Since 1871 (HIST 276) The human cost of World War I cannot be understood only in terms of demographics. To better understand the consequences of the war upon both soldiers and civilians it is necessary to consider mourning in its private, as well as its public dimensions. Indeed,

From playlist France Since 1871 with John Merriman

Video thumbnail

Sigrid & Murat in Budapest 2/5 @ El Sabor de Hungria, 2019

Sigrid van Tilbeurgh and Murat Erdemsel Hungary, Budapest, 23.08.2019

From playlist Tango

Video thumbnail

Sigrid & Murat in Budapest 3/5 @ El Sabor de Hungria, 2019

Sigrid van Tilbeurgh and Murat Erdemsel Hungary, Budapest, 23.08.2019

From playlist Tango

Video thumbnail

Rank Bounds for Design Matrices with Applications to Combinatorial Geometry... - Zeev Dvir

Zeev Dvir Institute for Advanced Study October 19, 2010 A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns in

From playlist Mathematics

Video thumbnail

Petr Golovach: Longest cycle above Paul Erdős-Gallai bound

In 1959, Paul Erdős and Gallai proved that every graph G with n vertices and more than (n - 1)l edges (l less or equals 2) contains a cycle of length at least l + 1. We provide an algorithmic extension of the Erdős-Gallai theorem: an FPT algorithm with parameter k, that decides whether the

From playlist Workshop: Parametrized complexity and discrete optimization

Video thumbnail

Lectures on compactness in the ̄∂–Neumann problem (Lecture 1) by Emil Straube

PROGRAM CAUCHY-RIEMANN EQUATIONS IN HIGHER DIMENSIONS ORGANIZERS: Sivaguru, Diganta Borah and Debraj Chakrabarti DATE: 15 July 2019 to 02 August 2019 VENUE: Ramanujan Lecture Hall, ICTS Bangalore Complex analysis is one of the central areas of modern mathematics, and deals with holomo

From playlist Cauchy-Riemann Equations in Higher Dimensions 2019

Video thumbnail

Sigrid & Murat in Budapest 5/5 @ El Sabor de Hungria, 2019

Sigrid van Tilbeurgh and Murat Erdemsel Hungary, Budapest, 23.08.2019

From playlist Tango

Video thumbnail

Duality: magic in simple geometry #SoME2

Two inaccuracies: 2:33 explains the first property (2:16), not the second one (2:24) Narration at 5:52 should be "intersections of GREEN and orange lines" Time stamps: 0:00 — Intro 0:47 — Polar transform 4:46 — Desargues's Theorem 6:29 — Pappus's Theorem 7:18 — Sylvester-Gallai Theorem 8

From playlist Summer of Math Exposition 2 videos

Video thumbnail

The BuShou of HanZi :耳

A brief description of the BuShou of 耳.

From playlist The BuShou of HanZi

Video thumbnail

The BuShou of HanZi :禾

A brief description of the BuShou of 禾.

From playlist The BuShou of HanZi

Video thumbnail

The BuShou of HanZi :囗

A brief description of the BuShou of 囗.

From playlist The BuShou of HanZi

Video thumbnail

The Computer Chronicles - Printers (1983)

This episode explores the history of printers in the computing world, as well as the present day situation and the types advancements expected in the future. Special thanks to archive.org for hosting these episodes. Downloads of all these episodes and more can be found at: http://archive

From playlist The Computer Chronicles 1983 Episodes

Video thumbnail

Lectures on compactness in the ̄∂–Neumann problem (Lecture 2) by Emil Straube

PROGRAM CAUCHY-RIEMANN EQUATIONS IN HIGHER DIMENSIONS ORGANIZERS: Sivaguru, Diganta Borah and Debraj Chakrabarti DATE: 15 July 2019 to 02 August 2019 VENUE: Ramanujan Lecture Hall, ICTS Bangalore Complex analysis is one of the central areas of modern mathematics, and deals with holomo

From playlist Cauchy-Riemann Equations in Higher Dimensions 2019

Video thumbnail

The BuShou of HanZi : 車

A brief description of the BuShou of 車.

From playlist The BuShou of HanZi

Video thumbnail

19861: A Superabundant Odyssey - #MegaFavNumbers

A tale of superabundant numbers, the Riemann Hypothesis, and a proof by assumption. This video is part of the #MegaFavNumbers collaboration: https://www.youtube.com/playlist?list=PLar4u0v66vIodqt3KSZPsYyuULD5meoAo Special thanks to Dr. Jonathan Clark and Dr. Ben Braun for their roles in

From playlist MegaFavNumbers

Video thumbnail

Ben Green - Problems about points and lines

December 19, 2014 - Analysis, Spectra, and Number theory: A conference in honor of Peter Sarnak on his 61st birthday. A well-known theorem called the Sylvester-Gallai theorem states that, given n points in R^2, either they all lie on a line or else there is an ordinary line - a line thro

From playlist Analysis, Spectra, and Number Theory - A Conference in Honor of Peter Sarnak on His 61st Birthday

Video thumbnail

Atlantic Pact Meeting (1949)

Thought to be Selected Originals from late 1940s material. Title reads: " Atlantic Pact Nations Meet". American voiceovered newsreel material. Washington DC, United States of America (USA). SV Dean Acheson, American Secretary of State and Ministers seated around conference table.

From playlist NATO

Video thumbnail

The BuShou of HanZi :宀

A brief description of the BuShou of 宀.

From playlist The BuShou of HanZi

Related pages

Gallai–Edmonds decomposition | Erdős–Gallai theorem | Graph theory | Arthur Milgram | Mathematics | Combinatorics | Gallai–Hasse–Roy–Vitaver theorem | Paul Erdős | Sylvester–Gallai theorem | Van der Waerden's theorem | Dilworth's theorem | Dénes Kőnig