χ-boundedness of bounded merge-width graphs

Speaker(s)

Colin Geniet

Language of the talk

English

Date

May 16, 2025, 2:15 p.m.

Room

room 5060

Seminar

Seminar Algorithms

---

Merge-width is a generalisation of twin-width and bounded expansion
classes, recently introduced by Dreier and Toruńczyk, for which the
first-order model checking problem is FPT.
This talk presents some elementary proofs of combinatorial properties of
merge-width, most notably χ-boundedness.

This is joint work with Marthe Bonamy.

---