YoVDO

Quasipolynomial Bounds for Some Problems in Extremal Combinatorics

Offered By: Institute for Advanced Study via YouTube

Tags

Combinatorial Mathematics Courses Discrete Mathematics Courses Graph Theory Courses Hypergraphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a concise conference talk on quasipolynomial bounds in extremal combinatorics. Delve into the research presented by Zander Kelley, a postdoctoral member at the Institute for Advanced Study. Gain insights into the latest developments and challenges in this specialized field of mathematics. Learn about the application of quasipolynomial bounds to various problems in extremal combinatorics and understand their significance in advancing mathematical knowledge. Benefit from this 17-minute presentation that offers a focused look at cutting-edge research in combinatorial mathematics.

Syllabus

Quasipolynomial Bounds for Some Problems in Extremal Combinatorics - Zander Kelley


Taught by

Institute for Advanced Study

Related Courses

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax
离散数学概论 Discrete Mathematics Generality
Peking University via Coursera
Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam
Discrete Mathematics
Shanghai Jiao Tong University via Coursera