Sparse Graphs Coalition

User Tools

Site Tools

Trace:
start

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
start [2024/06/15 08:21] – [Sessions] ross.kangstart [2025/02/08 11:40] (current) – ross.kang
Line 47: Line 47:
   * Hurley, Pirot. Uniformly Random Colourings of Sparse Graphs. https://arxiv.org/abs/2303.15367   * 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   * Duraj, Kang, La, Narboni, Pokrývka, Rambaud, Reinald. The χ-binding function for d-directional segment graphs. https://arxiv.org/abs/2309.06072
 +  * Bourneuf, Masaříková, Nadara, Pilipczuk. Graphs with no long claws: An improved bound for the analog of the Gyárfás’ path argument. https://arxiv.org/abs/2501.13907
 +  * Bousquet, Cames van Batenburg, Esperet, Joret, Micek. Shallow brambles, 2025. https://arxiv.org/abs/2502.04177
 +
  
 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". 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".
start.1718439719.txt.gz · Last modified: 2024/06/15 08:21 by ross.kang