/Exposé en anglais/Talk in english/
Let G be an arbitrary graph with chromatic number k, where k is large. We discuss the state of the art of the following three open questions.
• Erdős and Neumann-Lara (1979): does G admit an orientation with "high" dichromatic number? (The dichromatic number is the smallest size of a vertex partition in which each part induces an acyclic digraph.)
• Burr (1980): is it true that every orientation of G contains all oriented trees of order k/2 +1 ?
• Bukh (2015 or earlier): Is it true that typical subgraphs of G have chromatic number at least ck/log k for some positive constant c, independent of k ?
[Tassio Naia Dos Santos] (IME-USP)
https://www.ime.usp.br/~tassio/
{Remarques/Remarks}
▼
Cet exposé sera enregistré, merci de désactiver votre webcam et micro si vous ne souhaitez pas apparaître sur l'enregistrement. Les échanges informels avant et après l'exposé, ainsi que les questions, ne seront pas enregistrés.
N'hésitez pas à venir un peu avant le début de l'exposé pour faire des tests (et discuter informellement). Nous auront également des discussions informelles post-GT.
À très bientôt,
Marthe & Jonathan
Retrouvez toutes les informations du GT dématérialisé sur https://combalgo.labri.fr/pmwiki.php/Groupe/GT-en-LIGNE
▼
This presentation will be recorded, please deactivate your webcam and microphone if you do not wish to appear on the recording. Informal exchanges before and after the presentation, as well as questions, will not be recorded.
Do not hesitate to come a little before the start of the presentation to test (and chat informally). We will also have informal post-working group discussions.
See you soon,
Marthe & Jonathan
Find all the information of the dematerialized working group on the web page https://combalgo.labri.fr/pmwiki.php/Groupe/GT-en-LIGNE