Differences

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

--- sessions:2021sessions:2021session5 [2021/09/13 08:39] – ross.kang
+++ sessions:2021sessions:2021session5 [2022/03/09 07:08] – [Research results] ross.kang
@@ Line 6: / Line 6: @@
 There are a variety of questions to be investigated: **coloring, covering, decomposing or hitting problems**; questions about VC-dimension, epsilon-nets, and realizabilities; as well as **structural properties** like sparsity, or product structures. Hence we seek to gather experts together with mid-career and younger researchers from generally similar but specifically different backgrounds in combinatorial geometry.
+==== Organisers ====
+[[https://i11www.iti.kit.edu/en/members/torsten_ueckerdt/index|Torsten Ueckerdt]] and [[https://sites.google.com/view/yuditsky/home|Lena Yuditsky]]
 ==== Workshop dates ====
@@ Line 119: / Line 124: @@
 We give a sketch of the proof that the maximum chromatic number of a circle graph with clique number at most $\omega$ is equal to $\Theta ( \omega \log \omega)$.
+==== Research results ====
+  * Davies, Keller, Kleist, Smorodinsky, Walczak. A solution to Ringel’s circle problem. https://arxiv.org/abs/2112.05042
+  * Hickingbotham, Jungeblut, Merker, Wood. The product structure of squaregraphs. https://arxiv.org/abs/2203.03772