
Explores divergence in Coxeter groups, introducing the 'hypergraph index' to characterize linear, quadratic, and exponential divergence in these mathematical structures.

Explore the fascinating parallel between Coxeter groups and matroids in combinatorial cohomology, featuring recent research on singular Hodge theory for combinatorial geometries.

Explore the parallel between Coxeter groups and matroids in combinatorial cohomology, with insights on singular Hodge theory for combinatorial geometries from recent collaborative research.

Explore the fascinating world of graph theory, focusing on graphs with high chromatic numbers and their intriguing properties in this engaging mathematical lecture.

Explore matroids and canonical forms, their theoretical foundations, and practical applications in algebraic topology and related fields.

Explore graphons and graphexes as mathematical tools for analyzing large sparse graphs, with applications in network science and complex systems modeling.

Explore matroid theory's origins, connections, and recent geometric advances in combinatorial mathematics, highlighting matroid polytope, Bergman fan, and conormal fan models.

Explore recent advancements in graph theory, focusing on Hadwiger's conjecture. Learn about new techniques and results that have led to significant progress in this fundamental problem of graph coloring.

Explore connections between groups, manifolds, and graph limits in mathematics, uncovering fascinating relationships and applications in diverse areas of study.

Explore measurable graph combinatorics with Andrew Marks, delving into advanced mathematical concepts and their applications in this insightful lecture.

Explores a new algorithm for exact matching of correlated Erdos-Renyi graphs, improving noise robustness in graph matching for applications in computer vision and biology.

Explore the mathematical concept of weights in rooted k-trees, delving into their properties, applications, and theoretical foundations.

Explore connections between monomial ideals, graph theory, and coding theory in this advanced mathematics talk by Keri Sather-Wagstaff from Clemson University.

Explore new advances in designs, codes, and cryptography with Jeffrey Dinitz in this engaging 34-minute talk, highlighting recent developments and future directions in the field.

Explore the mathematical journey from Ramanujan graphs to Ramanujan complexes, delving into advanced number theory concepts and their applications in graph theory and topology.

Explore oriented graph coloring in disjoint unions, examining theoretical aspects and algorithmic implications in combinatorial algorithms.

Explore induced subgraphs and tree decompositions in graph theory, focusing on their properties, applications, and recent advancements in combinatorial algorithms.

Explore graph invariants and their connections to invariant theory in this insightful lecture by renowned mathematician Alexander Schrijver.

Explores supermodular covering theorem's applications in non-TDI graph optimization, including degree-constrained problems, connectivity augmentation, and extensions of disjoint arborescences theorem.

Exploración de límites de diámetro en grupos simétricos y algebraicos lineales, con énfasis en técnicas simplificadas y conexiones entre diferentes enfoques matemáticos.

Explore stability in permutation groups, unimodular random networks, and invariant random subgroups. Learn decision methods for equations in group theory and graph theory.