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

Aplicaciones de la teoría de grafos a la vida real
Miríadax
Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X]
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer