Tree conjecture on graphs and more colourings in polytopes
 
 
Description:  We will talk about some chromatic invariants in graphs and polytopes, and see what are the consequences of a nice description of the kernel of these chromatic maps in important problems like the tree conjecture. We will see that the most general version of this problem is in the realm of generalised permutahedra, as we will see that graphs and other interesting combinatorial objects can be embedded there.
Date:  2018-06-29
Start Time:   11:30
Speaker:  Raul Penaguião (Univ. Zurich, Switzerland)
Institution:  Universitat Zurich
Place:  Room 5.4, Department of Mathematics, U.C.
Research Groups: -Algebra and Combinatorics
See more:   <Main>  
 
© Centre for Mathematics, University of Coimbra, funded by
Science and Technology Foundation
Powered by: rdOnWeb v1.4 | technical support