start
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
start [2022/04/21 09:38] – ross.kang | start [2025/07/19 14:10] (current) – [Sessions] ross.kang | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== A Sparse (Graphs) Coalition ====== | ====== A Sparse (Graphs) Coalition ====== | ||
- | This is a loose European-based network of researchers, | + | This is a Europe-centred |
Line 22: | Line 22: | ||
===== Sessions ===== | ===== 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 | + | 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. Café sessions took place in 2022 and 2025. One session took place in each of 2022, 2023, 2024, 2025. |
- | The next/latest session is/was https:// | + | The next/latest session is/was https:// |
There is a subwiki listing the [[Sessions|sessions]] which have taken place or are planned. | There is a subwiki listing the [[Sessions|sessions]] which have taken place or are planned. | ||
Line 32: | Line 32: | ||
===== Results ===== | ===== Results ===== | ||
- | Our activities have been surprisingly | + | Our activities have been enjoyable and productive. Younger researchers, |
* Dvořák, Pekárek, Ueckerdt, Yuditsky. Weak Coloring Numbers of Intersection Graphs. https:// | * Dvořák, Pekárek, Ueckerdt, Yuditsky. Weak Coloring Numbers of Intersection Graphs. https:// | ||
* Dreier, Gajarsky, Jiang, Ossona de Mendez, Raymond. Twin-width and generalized coloring numbers. https:// | * Dreier, Gajarsky, Jiang, Ossona de Mendez, Raymond. Twin-width and generalized coloring numbers. https:// | ||
* Groenland, Kaiser, Treffers, Wales. Graphs of low average degree without independent transversals. https:// | * Groenland, Kaiser, Treffers, Wales. Graphs of low average degree without independent transversals. https:// | ||
- | * Davies, Illingworth. The $\chi$-Ramsey problem for triangle-free graphs. https:// | + | * Davies, Illingworth. The χ-Ramsey problem for triangle-free graphs. https:// |
* Hurley, Pirot. A first moment proof of the Johansson-Molloy theorem. https:// | * Hurley, Pirot. A first moment proof of the Johansson-Molloy theorem. https:// | ||
* Davies, Keller, Kleist, Smorodinsky, | * Davies, Keller, Kleist, Smorodinsky, | ||
Line 44: | Line 44: | ||
* Dvorák, Gonçalves, Lahiri, Tan, Ueckerdt. On Comparable Box Dimension. https:// | * Dvorák, Gonçalves, Lahiri, Tan, Ueckerdt. On Comparable Box Dimension. https:// | ||
* Cambie, Cames van Batenburg, Cranston. Optimally Reconfiguring List and Correspondence Colourings. https:// | * Cambie, Cames van Batenburg, Cranston. Optimally Reconfiguring List and Correspondence Colourings. https:// | ||
+ | * Cook, Masařík, Pilipczuk, Reinald, Souza. Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of $P_4$. https:// | ||
+ | * Hurley, Pirot. Uniformly Random Colourings of Sparse Graphs. https:// | ||
+ | * Duraj, Kang, La, Narboni, Pokrývka, Rambaud, Reinald. The χ-binding function for d-directional segment graphs. https:// | ||
+ | * Bourneuf, Masaříková, | ||
+ | * Bousquet, Cames van Batenburg, Esperet, Joret, Micek. Shallow brambles, 2025. https:// | ||
+ | |||
We believe that this method of working has broader scope, see https:// | We believe that this method of working has broader scope, see https:// | ||
Line 50: | Line 56: | ||
===== Members and Organisation ===== | ===== Members and Organisation ===== | ||
- | There is a subwiki listing the current [[Members|Members]]. | + | There is a subwiki listing the current [[Board|board]]. |
Announcements about the network are disseminated through [[https:// | Announcements about the network are disseminated through [[https:// |
start.1650533904.txt.gz · Last modified: 2022/04/21 09:38 by ross.kang