Probabilistic Methods in Combinatorics

In course

Non pariatur id est nostrud proident do aliqua est ipsum enim eiusmod dolore. Excepteur deserunt esse eu sunt commodo cupidatat do voluptate ex anim qui laboris voluptate cupidatat. Sint non dolor nostrud ad fugiat exercitation ullamco aute enim aliquip eiusmod et. Amet sint adipisicing veniam do consectetur. Sit cupidatat quis sit reprehenderit exercitation in Lorem voluptate deserunt sit labore reprehenderit. Nisi enim sint occaecat elit duis exercitation ad est culpa elit proident nulla. Dolor qui cupidatat qui deserunt.

Description

This lecture introduces probabilistic methods in combinatorics, focusing on monochromatic edges in hypergraphs, 2-colorable graphs, and the existence of good 2-colorings. The instructor covers the probabilistic method, events probability, and the union bound.

Official source

https://mediaspace.epfl.ch/media/0_8udquzc7

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Probability theory: Topics in probability theory

Art

Visual arts: Painting

Related lectures (34)