Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a lecture on the random Hall-Paige Conjecture delivered by Alexey Pokrovskiy, a renowned mathematician specializing in extremal combinatorics. Delve into the intersection of combinatorics and algebra as Pokrovskiy, a lecturer at University College London and recipient of the European Prize in Combinatorics, presents his research. Learn about the speaker's background, including his PhD on "Graph Powers, Partitions, and other Extremal Problems" and his work in Ramsey theory, Latin squares, and positional games. Gain insights from Pokrovskiy's experiences as a postdoc at Freie Universitat Berlin and ETH Zurich, and his current role at UCL. Discover how this one-hour lecture, presented at BIMSA, contributes to the field of mathematics and advances our understanding of complex combinatorial problems.
