Asymptotic enumeration of discrete structures: what, how and why
Introductory Workshop: Probability and Statistics of Discrete Structures January 27, 2025 - January 31, 2025
Location: SLMath: Eisenbud Auditorium, Online/Virtual
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
Asymptotic enumeration of discrete structures: what, how and why
Asymptotic enumeration involves finding an approximate formula for the size of a combinatorial set, with a relative error that gets smaller as the size of the set grows. For example, we might be interested in the number of hypergraphs with a given number of vertices and satisfying some other nice properties, and how this number behaves as the number of vertices tends to infinity. I will describe some methods for obtaining asymptotic enumeration formulae and some applications to the analysis of random graphs and hypergraphs.
Asymptotic enumeration of discrete structures: what, how and why
Please report video problems to itsupport@slmath.org.
See more of our Streaming videos on our main VMath Videos page.