List of upcoming online seminars in discrete mathematics, combinatorics, and graph theory

Here is a list of upcoming online seminars in combinatorics, automatically generated from researchseminars.org and a few other calendars available in the iCal format. Please let me know if you find any interesting iCal feed / Google Calendar of the seminars.

You can also find a list of upcoming workshops, conferences, and schools.

Timezone: Korea (KST), UTC/GMT+9.

June 2023

June 8 – June 9

Tianran Chen (Auburn University at Montgomery)
June 8 – June 9
11:15 pm – 1:00 am

Title: What lattice polytopes can tell us about network of oscillators?
by Tianran Chen (Auburn University at Montgomery) as part of Copenhagen-Jerusalem Combinatorics Seminar

Abstract
Lattice polytopes have found many, often surprising, applications in science and engineering. We begin this talk with a brief review of the connections
between symmetric edge polytopes and the Kuramoto equations, which are crucial in the study of networks of coupled oscillators derived from biology, chemistry, and engineering. We highlight the important information about Kuramoto equations that are encoded in the symmetric edge polytopes. We also extend this connection to other families of equations. Finally, we end with an exploration on what symmetric edge polytopes can tell us about the interesting phenomenon of oscillator death.

June 9

9:00 pm – 10:00 pm
[gt.go] - Some open problems by Marthe Bonamy

/Exposé en anglais/Talk in english/

In this talk, we will survey some open problems in graph theory, from graph minors to subgraph packing, including a few coloring questions. This selection will be extremely biased, with an attention to diversity of flavours.

[Marthe Bonamy] (CNRS, LaBRI )

[ https://www.labri.fr/perso/mbonamy | https://www.labri.fr/perso/mbonamy ]

Remarks / Remarques

Find all the information of the working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] .
Retrouvez toutes les informations du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT | page web ] .

June 13

4:30 pm – 5:30 pm
Minho Cho (IBS Extremal Combinatorics and Probability Group)

Title: Strong Erdős-Hajnal property on chordal graphs and its variants
by Minho Cho (IBS Extremal Combinatorics and Probability Group) as part of IBS/KAIST Discrete Math Seminar

View-only livestream: https://www.youtube.com/c/ibsdimag
Lecture held in Room B232, IBS.
Abstract: TBA

June 15 – June 16

no seminar
June 15 – June 16
11:15 pm – 1:00 am

Title: —-
by no seminar as part of Copenhagen-Jerusalem Combinatorics Seminar

Interactive livestream: https://ucph-ku.zoom.us/j/69937085835?pwd=S3J6UjQ0eFVPOU1hRUdCMHRnYXozUT09
Abstract: TBA

June 20

4:30 pm – 5:30 pm
Guanghui Wang (Shandong University)

by Guanghui Wang (Shandong University) as part of IBS/KAIST Discrete Math Seminar

View-only livestream: https://www.youtube.com/c/ibsdimag
Lecture held in Room B232, IBS.
Abstract: TBA

June 22 – June 23

Isaiah Osborne (Middle Tennessee State University)
June 22 – June 23
11:15 pm – 1:00 am

by Isaiah Osborne (Middle Tennessee State University) as part of Copenhagen-Jerusalem Combinatorics Seminar

Interactive livestream: https://ucph-ku.zoom.us/j/69937085835?pwd=S3J6UjQ0eFVPOU1hRUdCMHRnYXozUT09
Abstract: TBA

June 27

4:30 pm – 5:30 pm
Irene Gil Fernández (University of Warwick)

Title: How to build a pillar: a proof of Thomassen’s conjecture
by Irene Gil Fernández (University of Warwick) as part of IBS/KAIST Discrete Math Seminar

View-only livestream: https://www.youtube.com/c/ibsdimag
Lecture held in Room B232, IBS.
Abstract: TBA

June 29

5:00 pm
Christophe Paul, «Linear time modular decomposition algorithm»

There is a long history of modular decomposition algorithms starting in the 70’s with a $O(n^4)$ algorithm. The first linear time algorithms appeared in 1994 (by Cournier, Habib and by McConnell, Spinrad). Since them simplified (almost) linear time algorithms have been proposed. I will describe one based on LexBFS and a tree-partition refinement technique. The complexity analysis requires a carefully amortized analysis that we will discuss.

This is a joint work with D. Corneil, M. Habib and M. Tedder that was originally presented at ICALP’08, but which full version is still lacking.

July 2023

July 11

4:30 pm – 5:30 pm
Xuding Zhu (Zhejiang Normal University)

Title: List version of 1-2-3 conjecture
by Xuding Zhu (Zhejiang Normal University) as part of IBS/KAIST Discrete Math Seminar

View-only livestream: https://www.youtube.com/c/ibsdimag
Lecture held in Room B232, IBS.
Abstract: TBA

August 2023

August 2

4:30 pm – 5:30 pm
Daniel Král' (Masaryk University)

by Daniel Král’ (Masaryk University) as part of IBS/KAIST Discrete Math Seminar

View-only livestream: https://www.youtube.com/c/ibsdimag
Lecture held in Room B232, IBS.
Abstract: TBA

August 8

4:30 pm – 5:30 pm
Amzi Jeffs (Carnegie Mellon University)

Title: Intersection patterns of convex sets
by Amzi Jeffs (Carnegie Mellon University) as part of IBS/KAIST Discrete Math Seminar

View-only livestream: https://www.youtube.com/c/ibsdimag
Lecture held in Room B232, IBS.
Abstract: TBA

August 22

4:30 pm – 5:30 pm
Linda Cook (IBS Discrete Mathematics Group)

by Linda Cook (IBS Discrete Mathematics Group) as part of IBS/KAIST Discrete Math Seminar

View-only livestream: https://www.youtube.com/c/ibsdimag
Lecture held in Room B232, IBS.
Abstract: TBA