sessions:2023sessions:2023session1
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
sessions:2023sessions:2023session1 [2023/03/23 14:41] – [Schedule (all times Central European Summer Time)] ross.kang | sessions:2023sessions:2023session1 [2023/09/13 08:09] (current) – [Talks (all times Central European Summer Time)] ross.kang | ||
---|---|---|---|
Line 37: | Line 37: | ||
* Hoang La | * Hoang La | ||
* Alex Scott* | * Alex Scott* | ||
- | * Jędrzej Hodor | ||
* Dan Cranston | * Dan Cranston | ||
* Amadeus Reinald | * Amadeus Reinald | ||
Line 69: | Line 68: | ||
* Paloma T. Lima | * Paloma T. Lima | ||
* Tomas Kaiser | * Tomas Kaiser | ||
+ | * Sepehr Hajebi | ||
+ | * Hidde Koerts | ||
+ | * Aristotelis Chaniotis | ||
+ | * Paul Seymour | ||
* indicates speaker | * indicates speaker | ||
Line 81: | Line 83: | ||
Template: {{ sessions: | Template: {{ sessions: | ||
- | Deadline: 21 March 2023 | + | Deadline: 21 March 2023 (closed) |
==== Schedule (all times Central European Summer Time) ==== | ==== Schedule (all times Central European Summer Time) ==== | ||
We prioritise European participation, | We prioritise European participation, | ||
- | |||
- | The following schedule is tentative: | ||
1. //Monday, 27 March// | 1. //Monday, 27 March// | ||
Line 106: | Line 106: | ||
* 16:30 close of meeting | * 16:30 close of meeting | ||
+ | ==== Talks (all times Central European Summer Time) ==== | ||
+ | |||
+ | === Sophie Spirkl: χ-boundedness and η-boundedness === | ||
+ | |||
+ | I will talk about η(G), the minimum size of a set of vertices X in G such that α(G\X) < α(G). This parameter has some surprising parallels with χ(G), and in particular, one can ask about “η-boundedness, | ||
+ | |||
+ | This is based on joint work with Sepehr Hajebi and Yanjia Li. | ||
+ | |||
+ | 14:05, 28 March, https:// | ||
+ | |||
+ | === Alex Scott: On a problem of El-Zahar and Erdős === | ||
+ | |||
+ | Two subgraphs A, B of a graph G are anticomplete if they are vertex-disjoint and there are no edges joining them. Is it true that if G is a graph with bounded clique number, and sufficiently large chromatic number, then it has two anticomplete subgraphs, both with large chromatic number? This is a question raised by El-Zahar and Erdős in 1986, and remains open. If so, then at least there should be two anticomplete subgraphs both with large minimum degree, and that is one of our results. | ||
+ | |||
+ | We prove two variants of this. First, a strengthening: | ||
+ | |||
+ | This is joint work with Tung Nguyen and Paul Seymour. | ||
+ | |||
+ | 16:15, 29 March, https:// | ||
+ | |||
+ | ==== Research results ==== | ||
+ | * Duraj, Kang, La, Narboni, Pokrývka, Rambaud, Reinald. The χ-binding function for d-directional segment graphs. https:// |
sessions/2023sessions/2023session1.1679582503.txt.gz · Last modified: 2023/03/23 14:41 by ross.kang