Combinatorics and graph theory

Sincronización y no-sincronización en grafos geométricos aleatorios

Synchronization and non-synchronization in random geometric graphs

Joseph Dorfer --- NP-completeness of finding shortest combinatorial paths in the Associahedron.

Combinatorial problems - a place where classical enumeration fails | Pavol Kollár

How Networks Shape Our Lives by Frank den Hollander

John Conway - Four Color Theorem and Computer Proofs

[#PE²C S1E3] Comment faire un arc-en-ciel avec le moins de couleurs possible ? | ENS-PSL

[#PE²C S1E3] How to make a rainbow with the fewest colors possible? | ENS-PSL

Counting problems - C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

Lecture 1: Pigeonhole Principle

Algo Extraño Ocurre Cuando Rastreas Qué Tan Conectados Estamos

Colorier une carte, un défi mathématique par Roger MANSUY - Festival d'Astronomiede Fleurance

Coloring a map, a mathematical challenge by Roger Mansuy - Fleurance Astronomy Festival

Can you really reach anyone in 6 steps?

Graph theory (1)

UofM - MATH 2740 - Lecture 19 - Graph theory (Graph measures 3)

UofM - MATH 2740 - Lecture 15 - Graph theory (strong connectedness and matrices)

Permutations and Combinations - BSc Physics Series - by Shilpy Bhullar (Hindi/English)

Cours 05 - Fonctions d'incidence

Learning About Quantum States 5: The Robinson--Schensted--Knuth Algorithm

Olympiad level counting (Generating functions)

UofM - MATH 2740 - Lecture 21 - Part 1 - Graph theory (Air transport in MB)

UofM - MATH 2740 - Lecture 20 - Graph theory (Air transport in MB)

UofM - MATH 2740 - Lecture 18 - Graph theory (Graph measures 2)

UofM - MATH 2740 - Lecture 17 - Part 2 - Graph theory (Graph measures 1)

UofM - MATH 2740 - Lecture 17 - Part 1 - Graph theory (Introduction to RMarkdown)

UofM - MATH 2740 - Lecture 16 - Part 2 - Graph theory (computer example)

UofM - MATH 2740 - Lecture 16 - Part 1 - Graph theory (associated matrices)

UofM - MATH 2740 - Lecture 14 - Part 2 - Graph theory (Spanning trees - igraph)

UofM - MATH 2740 - Lecture 14 - Part 1 - Graph theory (Cycles, spanning trees)

UofM - MATH 2740 - Lecture 13 - Part 2 - Graph theory (Introduction to igraph)

UofM - MATH 2740 - Lecture 13 - Part 1 - Graph theory (Introduction)

Spectral Graph Theory problems || @ CMU || Recitation 8 of CS Theory Toolkit

The Central Binomial Coefficient || @ CMU || Recitation 1 of CS Theory Toolkit

Cayley's tree formula (after Andre Joyal)

Trees and Series-Parallel Graphs || @ CMU || Lecture 22a of CS Theory Toolkit

Expander Graphs Overview || @ CMU || Lecture 16a of CS Theory Toolkit

Expander Graphs Application 1: Good Codes || @ CMU || Lecture 16b of CS Theory Toolkit

Expander Graph Constructions || @ CMU || Lecture 16d of CS Theory Toolkit

Spectral Graph Theory: mixing time || @ CMU || Lecture 15c of CS Theory Toolkit

Spectral Graph Theory: conductance and Sparsest-Cut || @ CMU || Lecture 15b of CS Theory Toolkit

Spectral Graph Theory: eigenvalues || @ CMU || Lecture 15a of CS Theory Toolkit

Spectral Graph Theory: the Laplacian, and the Spectral Theorem || @ CMU || 14b of CS Theory Toolkit