BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260910T072005Z
UID:Seminar-dept-1227@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20240327T130000
DTEND:20240327T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Bogdan Alecu: Partitions of graphs into chain graphs & co.\n\nAn undirected simple graph is a {\em chain graph} if it is bipartite, and for each part, the neighbourhoods of the vertices in that part can be ordered linearly with respect to inclusion (or equivalently, if it is bipartite, and does not contain $2K_2$ -- the complement of a chordless cycle on 4 vertices -- as an induced subgraph).\n\n\n\nIn this talk, we will explore some parameters related to partitioning graphs into chain graphs (and some appropriately defined ``complements''). We will discuss the motivation behind these parameters, which originated in the world of permutation patterns on the one hand, and in the study of well-quasi-orderability under induced subgraphs on the other. We will then go through various results surrounding the parameters, and present several open problems.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1227
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR