Sparse Graphs Coalition

User Tools

Site Tools

Trace: • 2021session3
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 [2025/07/19 14:10] – [Sessions] ross.kangstart [2025/10/23 21:22] (current) – ross.kang
Line 49: Line 49:
   * 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   * 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   * Bousquet, Cames van Batenburg, Esperet, Joret, Micek. Shallow brambles, 2025. https://arxiv.org/abs/2502.04177
 +  * Kaul, Marciaga, Mudrock. List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph, 2025. https://arxiv.org/abs/2509.16733
 +  * Axenovich, Cames van Batenburg, Janzer, Michel, Rundström. An improved upper bound for the multicolour Ramsey number of odd cycles, 2025. https://arxiv.org/abs/2510.17981
  
  
start.1752934253.txt.gz · Last modified: 2025/07/19 14:10 by ross.kang