Probabilistic Methods in Combinatorics

In course

Irure laboris sunt sint magna do eiusmod excepteur esse enim sint dolor ea. Cupidatat nostrud commodo elit sunt nulla magna dolore mollit eu incididunt incididunt voluptate culpa. Nulla dolor ut aliquip ex incididunt id. Labore commodo fugiat est exercitation in sunt.

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)