Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the intersection of extremal combinatorics and random discrete structures in this 51-minute conference talk from BIMSA's ICBS2025. Delve into advanced mathematical concepts where extremal problems meet probabilistic methods, examining how classical combinatorial optimization questions behave within random settings. Learn about cutting-edge research techniques for analyzing discrete structures when randomness is introduced, and discover how probabilistic tools can provide insights into extremal combinatorial problems. Gain understanding of the theoretical frameworks used to study maximum and minimum properties in random graphs, hypergraphs, and other discrete mathematical objects.
