Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...
Abstract Forty years ago, Kleitman considered the numbers of crossings in good planar drawings of the complete bipartite graph ${K_{m,n}}$. Among other things, he ...
D. Fan, S. Goryainov, X. Huang, H. Lin, The spanning k-trees, perfect matchings and spectral radius of graphs, Linear Multilinear Algebra 70 (2022), 7264–7275. P ...
4monon MSN
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback