This year's winter school will be about cut problems, given by our new
member Eero Raty.
Please find all information here: https://www.ibs.re.kr/ecopro/winter-2026/
- Time: everyday Jan 19 to Jan 23, 2026, offline at IBS headquarter B332.
Online: *10:00-11:30am (Seoul)*.
- *Zoom: 955 7502 7689, PW: 260119*
This mini-course will serve as an introduction to cut problems in graphs
and related topics. The course will begin by covering the basics of
spectral graph theory, including the Alon–Boppana theorem and the expander
mixing lemma. We will then introduce some fundamental tools in the field,
such as the Goemans–Williamson algorithm, along with its applications to
various types of max-cut problems in graphs and hypergraphs. Towards the
end of the course, we will explore recent advancements in the area, which
rely on more involved spectral properties of adjacency matrices.
Wish you a happy and productive 2026 ahead,
Hong
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
