https://sparse-graphs.mimuw.edu.pl/ 2026-10-06T03:34:03+00:00 https://sparse-graphs.mimuw.edu.pl/ https://sparse-graphs.mimuw.edu.pl/lib/tpl/dokuwiki/images/favicon.ico text/html 2025-02-08T11:39:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://sparse-graphs.mimuw.edu.pl/doku.php?id=sessions:2021sessions:2021session1&rev=1739014777&do=diff 2021 Session 1 : Generalized coloring numbers and friends The topic of the workshop are Generalized Coloring Numbers: weak and strong coloring numbers, admissibility, centered colorings, low treedepth colorings, connections between these concepts and the notions of bounded expansion and of nowhere denseness, and closely related subjects. We believe that there is a number of very concrete questions that remain open in this area, for instance regarding tight asymptotics of relations between respe… text/html 2023-09-22T15:12:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://sparse-graphs.mimuw.edu.pl/doku.php?id=sessions:2021sessions:2021session2&rev=1695395536&do=diff 2021 Session 2 : Entropy Compression and Related Methods Lovász local lemma, entropy compression, stochastic local search algorithms, cluster expansion, hard-core model, exponentially many hypergraph colourings, and related topics/techniques. Organisers text/html 2021-12-15T20:21:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://sparse-graphs.mimuw.edu.pl/doku.php?id=sessions:2021sessions:2021session3&rev=1639599710&do=diff 2021 Session 3 : Extremal and Algorithmic Aspects of Partition Functions Algorithmic aspects of partition functions includes finding fast algorithms for counting combinatorial objects e.g. independent sets, matchings, colourings, and more generally approximately evaluating of their generating functions e.g. independence polynomial, matching polynomial, chromatic/Tutte polynomials /Potts model. This could include using Markov chain techniques, correlation decay, the use of zero-free regions, clu… text/html 2022-04-21T09:39:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://sparse-graphs.mimuw.edu.pl/doku.php?id=sessions:2021sessions:2021session4&rev=1650533971&do=diff 2021 Session 4 : Graph Reconfiguration In graph reconfiguration, we are given two solutions of a problem and the goal is to transform a solution into another while keeping a valid solution all along the transformation. Reconfiguration is related to various fields such as enumeration, counting, random sampling, discrete geometry, bio-informatics, or combinatorial game theory. text/html 2022-03-18T10:02:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://sparse-graphs.mimuw.edu.pl/doku.php?id=sessions:2021sessions:2021session5&rev=1647597731&do=diff 2021 Session 5 : Geometric graphs and hypergraphs In combinatorial geometry we study combinatorial questions in usually discrete geometric settings. Particularly important are geometrically defined graphs, e.g. intersection graphs of objects in d-dimensional space, text/html 2022-02-10T12:45:03+00:00 Anonymous (anonymous@undisclosed.example.com) https://sparse-graphs.mimuw.edu.pl/doku.php?id=sessions:2021sessions:2021session6&rev=1644497103&do=diff 2021 Session 6 : Positional games on sparse/random graphs We play positional games on edge sets of graphs, two players alternately claim unclaimed edges of a given graph until all the edges are claimed. There are several variants of positional games: