sessions:2021sessions:2021session5
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
sessions:2021sessions:2021session5 [2021/07/27 11:14] – lena | 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: | There are a variety of questions to be investigated: | ||
+ | |||
+ | ==== Organisers ==== | ||
+ | |||
+ | [[https:// | ||
+ | |||
==== Workshop dates ==== | ==== Workshop dates ==== | ||
- | **30 August-3 September 2021** | + | **30 August |
==== Workshop Format ==== | ==== Workshop Format ==== | ||
Line 19: | Line 24: | ||
==== Registration ==== | ==== Registration ==== | ||
- | Please indicate whether you want to participate in the following form: ____________ | + | The deadline for registration is August 18. In case that more people are interested to attend than we can handle, we might need to decline some. So we would be grateful for a timely registration, |
- | Registration details: Please | + | Registration details: Please use the form sent in the invitation email. |
- | Registration deadline: | + | Registration deadline: **August 18** (Wednesday) (closed) |
Confirmed participants: | Confirmed participants: | ||
Line 29: | Line 34: | ||
* [[torsten.ueckerdt@kit.edu|Torsten Ueckerdt]] (organiser) | * [[torsten.ueckerdt@kit.edu|Torsten Ueckerdt]] (organiser) | ||
* [[yuditskyl@gmail.com|Lena Yuditsky]] (organiser) | * [[yuditskyl@gmail.com|Lena Yuditsky]] (organiser) | ||
+ | * Piotr Micek | ||
+ | * Nora Frankl | ||
+ | * David Wood | ||
+ | * Dömötör Pálvölgyi | ||
+ | * Zdeněk Dvořák | ||
+ | * Balazs Keszegh | ||
+ | * Tamara Mtsentlintze | ||
+ | * Stefan Felsner | ||
+ | * Bartosz Walczak | ||
+ | * Linda Kleist | ||
+ | * Daniel Gonçalves | ||
+ | * Lena Schlipf | ||
+ | * Fabian Klute | ||
+ | * James Davies | ||
+ | * Chaya Keller | ||
+ | * Bruno Jartoux | ||
+ | * Laura Merker | ||
+ | * Paul Jungeblut | ||
+ | * Nicolas Bousquet | ||
+ | * Robert Hickingbotham | ||
+ | * Vera Chekan | ||
+ | * Jane Tan | ||
+ | * Justin Dallant | ||
+ | * Piotr Mikołajczyk | ||
+ | * Shakhar Smorodinsky | ||
==== Open problems ==== | ==== Open problems ==== | ||
- | For a smooth beginning of the workshop and an interesting set of open problems, we would like to ask all participants to submit any open problem they want to contribute to us beforehand. Please provide a brief description using the following | + | For a smooth beginning of the workshop and an interesting set of open problems, we would like to ask all participants to submit any open problem they want to contribute to us beforehand. Please provide a brief description using the template |
- | Submission details: Please | + | Submission details: Please use the template |
- | Submission deadline: **August 25** (Wednesday before the workshop) | + | Submission deadline: **August 25** (Wednesday before the workshop) (closed) |
- | ==== Schedule | + | ==== Schedule ==== |
The workshop will have 3-4 talks about recent breakthroughs in the field (2 talks on Monday, 1 talk on Tuesday and possibly 1 talk on Wednesday) and the rest of the time dedicated to problem solving in groups and socializing. | The workshop will have 3-4 talks about recent breakthroughs in the field (2 talks on Monday, 1 talk on Tuesday and possibly 1 talk on Wednesday) and the rest of the time dedicated to problem solving in groups and socializing. | ||
+ | | ||
1. Monday, 30 August | 1. Monday, 30 August | ||
- | | + | |
+ | 10.15am Talk -- Zdeněk Dvořák | ||
+ | “Product structure and related geometric representations” | ||
+ | 11.15am Coffee break | ||
+ | 11.30am Talk -- Dömötör Pálvölgyi | ||
+ | “Coloring Geometric Hypergraphs” | ||
+ | 1.30pm Open problem session | ||
+ | 3pm Partitioning into groups | ||
+ | 4pm Coffee break | ||
2. Tuesday, 31 August | 2. Tuesday, 31 August | ||
+ | 10am Coffee break | ||
+ | 2pm Coffee break | ||
+ | 2.15pm Talk -- James Davies | ||
+ | " | ||
+ | 3.15pm Progress report | ||
3. Wednesday, 1 September | 3. Wednesday, 1 September | ||
+ | 10am Coffee break | ||
+ | 2pm Coffee break | ||
+ | 3pm Progress report | ||
+ | 8pm Socializing | ||
4. Thursday, 2 September | 4. Thursday, 2 September | ||
+ | 10am Coffee break | ||
+ | 2pm Coffee break | ||
+ | 3pm Progress report | ||
5. Friday, 3 September | 5. Friday, 3 September | ||
+ | 10am Coffee break | ||
+ | 2pm Coffee break | ||
+ | 2.30pm Wrap up meeting | ||
+ | |||
(All the times should be read Central European Summer Time, i.e. UTC+2). | (All the times should be read Central European Summer Time, i.e. UTC+2). | ||
- | ==== Talks (tbc) ==== | + | ==== Talks ==== |
+ | |||
+ | ===Talk Monday 10.15am, Zdeněk Dvořák, " | ||
+ | |||
+ | Dujmović, Joret, Micek, Morin, Ueckerdt, and Wood recently proved that, rather | ||
+ | surprisingly, | ||
+ | graph of treewidth at most 8. Graphs with such a product structure can be | ||
+ | geometrically represented as touching graphs of axis-aligned boxes which are | ||
+ | the product of a unit interval with a hypercube. | ||
+ | these results, especially from the perspective of the graph sparsity theory. | ||
+ | |||
+ | ===Talk Monday 11.30am, Dömötör Pálvölgyi, | ||
+ | |||
+ | I will survey results related to coloring geometric hypergraphs that arise from range spaces. We will be interested only in the big/fat hyperedges, i.e., in the ones that contain many vertices. For example, recently we have shown (joint work with Damasdi) that any finite set of planar points can be 3-colored such that any unit disk containing at least 666 points contains two differently colored points, but the same does not hold for disks of arbitrary radius. In my talk I'll highlight some questions left open, for a complete list, see https:// | ||
+ | |||
+ | ===Talk Tuesday 2.15pm, James Davies, " | ||
+ | |||
+ | 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, | ||
+ | * Hickingbotham, | ||
sessions/2021sessions/2021session5.txt · Last modified: 2022/03/18 10:02 by ross.kang