The aim of CoSP was to bring together combinatorialists of various fields with the aim that they will enrich each other’s techniques. The tool kits utilized knowledge from topology, probability, statistical physics and algebra. These were applied to matching problems (a central topic in combinatorics), algorithmic problems, coloring problems (which are decompositions into independent sets or matchings) and homomorphisms (a generalization of colorings).
Researchers from Charles University, CNRS and Technion collaborated on the project with Rutgers University (US), Princeton University (US), University of California, Berkeley (US), Los Alamos (US) and Simon-Fraser University from Canada. Thanks to CoSP, interesting results were published on top conferences and journals in the field (e.g. Physical Review E, Proceedings of the American Mathematical Society, Journal of Graph Theory, Israel Journal of Mathematics, Combinatorica).
We are proud that CoSP managed to successfully involve young researchers. Until now, fourteen articles were published with them as co-authors thanks to CoSP training and research opportunities. They published e.g. in AAMAS 2025, Journal of Computational Geometry and Discrete Optimization journal.
More details about the results are available in the "Results" section.
Posted on 2025-03-20