N&O Lecture Ross Kang (Radboud University): Colouring powers of graphs with one cycle length forbidden
Everyone is welcome to attend the N&O lecture of Ross Kang at CWI. Abstract: Graph powers arise naturally in the study of, for example, efficientnetwork communication. Some basic problems have long been studied andremain stubbornly open.
- https://www.cwi.nl/events/2017/n-o-lectures-2017/no-lecture-ross-kang-radboud-university-colouring-powers-of-graphs-one-cycle-length-forbidden
- N&O Lecture Ross Kang (Radboud University): Colouring powers of graphs with one cycle length forbidden
- 2017-02-01T10:00:00+01:00
- 2017-02-01T11:00:00+01:00
- Everyone is welcome to attend the N&O lecture of Ross Kang at CWI. Abstract: Graph powers arise naturally in the study of, for example, efficientnetwork communication. Some basic problems have long been studied andremain stubbornly open.
- What Networks & Optimization
- When Feb 01, 2017 from 10:00 AM to 11:00 AM (Europe/Amsterdam / UTC100)
- Where Room L016, ground floor CWI
- Web Visit external website
-
Add event to calendar
iCal
Everyone is welcome to attend the N&O lecture of Ross Kang at CWI.
Abstract: Graph powers arise naturally in the study of, for example, efficient
network communication. Some basic problems have long been studied and
remain stubbornly open. I will first discuss previous work on the
chromatic number of graph powers, for graphs of maximum degree d,
often taking d very large. This is related to conjectures of Bollobás
and of Erdos and Nešetril from the 1980s. Then I will discuss
restricted versions where we impose an additional girth or cycle
length restriction. This relates to a problem of Alon and Mohar. This
is joint work with Francois Pirot.