Dear Colleagues, let me to invite you to 122. Mathematical Colloquium - prof. Alexander Scott (on this Thursday 2.2.2023)
____________________________________________________________________
122. kolokvium:
GRAPHS OF LARGE CHROMATIC NUMBER
A. D. Scott
ctvrtek 2. unora 2023 ve 14:00, aula (refektar), prvni patro
MFF UK, Malostranske nam. 25, Praha 1 ____________________________________________________________________
Abstract. The chromatic number has been a~fundamental topic of study in graph theory for more than 150 years. Graph colouring has a~deep combinatorial theory and, as with many NP-hard problems, is of interest in both mathematics and computer science. An important challenge is to understand graphs with very large chromatic number. The chromatic number tells us something global about the structure of a graph: if $G$ has small chromatic number then it can be partitioned into a~few very simple pieces. But what if $G$ has large chromatic number? Is there anything that we can say about its local structure? In particular, are there particular substructures that it must contain? In this talk, we will discuss recent progress and open problems in this area. ________________________________________________________________________
(pdf pozvanky: https://kam.mff.cuni.cz/~klazar/scott.pdf)
Dear Colleagues, let me to invite you to 122. Mathematical Colloquium - prof. Alexander Scott (on this Thursday 2.2.2023)
- kolokvium:
GRAPHS OF LARGE CHROMATIC NUMBER
A. D. Scott
ctvrtek 2. unora 2023 ve 14:00, aula (refektar), prvni patro
MFF UK, Malostranske nam. 25, Praha 1 ____________________________________________________________________
Abstract. The chromatic number has been a~fundamental topic of study in graph theory for more than 150 years. Graph colouring has a~deep combinatorial theory and, as with many NP-hard problems, is of interest in both mathematics and computer science. An important challenge is to understand graphs with very large chromatic number. The chromatic number tells us something global about the structure of a graph: if $G$ has small chromatic number then it can be partitioned into a~few very simple pieces. But what if $G$ has large chromatic number? Is there anything that we can say about its local structure? In particular, are there particular substructures that it must contain? In this talk, we will discuss recent progress and open problems in this area. ________________________________________________________________________
(pdf pozvanky: https://kam.mff.cuni.cz/~klazar/scott.pdf)
TCS-l mailing list -- tcs-l@kam.mff.cuni.cz To unsubscribe send an email to tcs-l-leave@kam.mff.cuni.cz