YoVDO

Toward a Density Corradi-Hajnal Theorem for Degenerate Hypergraphs - ICBS 2024

Offered By: BIMSA via YouTube

Tags

Hypergraphs Courses Combinatorics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive lecture on the study of extremal hypergraph theory, focusing on the maximum number of edges in r-graphs with limited vertex-disjoint copies of a given hypergraph. Delve into the extension of previous results and the systematic investigation of degenerate hypergraphs, examining near-optimal upper bounds for various intervals of t. Analyze the distinct structures of extremal constructions across different intervals and discover characterizations for specific cases. Learn how the presented proof technique applies to certain nondegenerate hypergraphs, including those with undetermined TurĂ¡n densities, providing valuable insights into this complex area of combinatorial mathematics.

Syllabus

Jianfeng Hou: Toward a density Corr\'{a}di--Hajnal theorem for degenerate hypergraphs #ICBS2024


Taught by

BIMSA

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera
Analytic Combinatorics, Part II
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Principles of Computing (Part 1)
Rice University via Coursera
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera