Hamiltonian graphs are graphs where one can find a closed walk that touches all vertices exactly once. Equivalently, they are the graphs whose vertices can be labeled from 1 to n so that all of 12, 23, 34, …, n1 feature among the edges. This…
Eventi
From combinatorics to PDE – Francesco Mattesini (Münster University/Max Planck Institute Leipzig )
The optimal matching problem is a popular random variational problem that received interest in the last 30 years. It was…