Differences

This shows you the differences between two versions of the page.

--- start [2022/02/11 14:20] – [Members and Organisation] ross.kang
+++ start [2023/11/16 13:43] (current) – [Sessions] ross.kang
@@ Line 1: / Line 1: @@
 ====== A Sparse (Graphs) Coalition ======
-This is a loose European-based network of researchers, formed in 2020 to stimulate research and collaboration in graph theory, particularly through remote means.
+This is a Europe-centred network of researchers, formed in 2020 to stimulate research and collaboration in graph theory, particularly through remote means.
@@ Line 14: / Line 14: @@
 The main activities are lightweight, interactive, online sessions of a week in duration, each centred around a particular theme (problem/conjecture/method/result).
-Lightweight is meant to allow for flexible participation, when it is difficult to displace ongoing responsibilities.
+Lightweight is meant to allow for meaningful and flexible participation, when it is difficult to displace ongoing responsibilities.
-It also ensures that organisational burden is light and quick.
+It also ensures that the organisational burden is (exceptionally) light and short.
 Each event is organised by a different set of members of the network each time.
@@ Line 22: / Line 22: @@
 ===== Sessions =====
-The first set of sessions were February and March of 2021. The second were in May and June of 2021. The third were in August and September of 2021. A café session took place in February of 2022.
+The first set of sessions were February and March of 2021. The second were in May and June of 2021. The third were in August and September of 2021. A café session took place in February of 2022. One session took place in 2022. Another took place in 2023.
+The next/latest session is/was https://sparse-graphs.mimuw.edu.pl/doku.php?id=sessions:2024sessions:2024session1
 There is a subwiki listing the [[Sessions|sessions]] which have taken place or are planned.
@@ Line 30: / Line 32: @@
 ===== Results =====
-Our activities have been surprisingly enjoyable and productive. Younger researchers, especially, have benefited greatly from the interactive experiences we've fostered. Through feedback surveys, participants are overwhelmingly positive. It is an added bonus that the sessions have consistently produced significant scientific output.
+Our activities have been enjoyable and productive. Younger researchers, especially, have benefited greatly from the interactive experiences we've fostered. Through feedback surveys we administered, participants are overwhelmingly positive. The sessions have consistently produced significant scientific output:
   * Dvořák, Pekárek, Ueckerdt, Yuditsky. Weak Coloring Numbers of Intersection Graphs. https://arxiv.org/abs/2103.17094
   * Dreier, Gajarsky, Jiang, Ossona de Mendez, Raymond. Twin-width and generalized coloring numbers. https://arxiv.org/abs/2104.09360
   * Groenland, Kaiser, Treffers, Wales. Graphs of low average degree without independent transversals. https://arxiv.org/abs/2106.15175
-  * Davies, Illingworth. The $\chi$-Ramsey problem for triangle-free graphs. https://arxiv.org/abs/2107.12288
+  * Davies, Illingworth. The χ-Ramsey problem for triangle-free graphs. https://arxiv.org/abs/2107.12288
   * Hurley, Pirot. A first moment proof of the Johansson-Molloy theorem. https://arxiv.org/abs/2109.15215
   * Davies, Keller, Kleist, Smorodinsky, Walczak. A solution to Ringel’s circle problem. https://arxiv.org/abs/2112.05042
   * Barkey, Clemens, Hamann, Mikalački, Sgueglia. Multistage positional games. https://arxiv.org/abs/2202.04344
+  * Hickingbotham, Jungeblut, Merker, Wood. The product structure of squaregraphs. https://arxiv.org/abs/2203.03772
+  * Dvorák, Gonçalves, Lahiri, Tan, Ueckerdt. On Comparable Box Dimension. https://arxiv.org/abs/2203.07686
+  * Cambie, Cames van Batenburg, Cranston. Optimally Reconfiguring List and Correspondence Colourings. https://arxiv.org/abs/2204.07928
+  * Cook, Masařík, Pilipczuk, Reinald, Souza. Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of $P_4$. https://arxiv.org/abs/2209.06171
+  * Hurley, Pirot. Uniformly Random Colourings of Sparse Graphs. https://arxiv.org/abs/2303.15367
+  * Duraj, Kang, La, Narboni, Pokrývka, Rambaud, Reinald. The χ-binding function for d-directional segment graphs. https://arxiv.org/abs/2309.06072
+We believe that this method of working has broader scope, see https://euromathsoc.org/magazine/issues/120/mag-23. We are happy to share our experiences with this "online research guild".
@@ Line 51: / Line 60: @@
 The network was founded by and is coordinated by [[ross.kang@gmail.com|Ross Kang]] and [[sereni@kam.mff.cuni.cz|Jean-Sébastien Sereni]]. A first meeting of the organisational team took place in December 2020.
-We believe that this method of working has broader scope, see https://euromathsoc.org/magazine/issues/120/mag-23. We are happy to share our experiences with our "online research guild".