YoVDO

Partitioning a Tournament into Sub-Tournaments of High Connectivity

Offered By: BIMSA via YouTube

Tags

Graph Theory Courses Random Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a lecture on partitioning tournaments into highly connected sub-tournaments presented by Antonio Girao at BIMSA. Delve into the world of extremal and probabilistic combinatorics, Ramsey theory, and random graphs as Girao, a postdoctoral researcher with experience at Cambridge, Birmingham, Heidelberg, and Oxford, shares his expertise. Learn about the intricate process of dividing tournaments into sub-structures with high connectivity, a topic that combines elements of graph theory and combinatorics. Gain insights into the mathematical challenges and techniques involved in this area of research during this hour-long presentation. Enhance your understanding of advanced concepts in discrete mathematics and their applications in tournament theory.

Syllabus

Antonio Girao: Partitioning a tournament into sub-tournaments of high connectivity


Taught by

BIMSA

Related Courses

Теория вероятностей для начинающих
Moscow Institute of Physics and Technology via Coursera
Universality of Random Graphs - Gal Kronenberg
Institute for Advanced Study via YouTube
The Science of Networks - C4 Public Lectures
Santa Fe Institute via YouTube
Optimization of the Sherrington-Kirkpatrick Hamiltonian
IEEE via YouTube
Fast Uniform Generation of Random Graphs with Given Degree Sequences
IEEE via YouTube