BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Marija Jelić Milutinović (University of Belgrade)
DTSTART:20220224T151500Z
DTEND:20220224T170000Z
DTSTAMP:20260424T094651Z
UID:CJCS/56
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/56/">Ma
 tching complexes of graphs</a>\nby Marija Jelić Milutinović (University 
 of Belgrade) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAb
 stract\nThe matching complex M(G) of a graph G is the simplicial complex w
 ith the vertex set given by edges of G and faces given by subsets of pairw
 ise disjoint edges\, i.e.\, matchings of G. There is a long history of the
  study of matching complexes\, and there are many results on the topology 
 of the matching complexes of interesting classes of graphs. We will discus
 s the reverse question: which simplicial complexes are matching complexes 
 of graphs? In this talk we will answer this question for the homology mani
 folds\, with and without boundary. While in dimension 2 there are several 
 interesting manifolds\, in dimension three and higher the only matching co
 mplexes are combinatorial spheres and combinatorial disks. Moreover\, the 
 graphs that produce manifold matching complexes are all constructed from t
 he disjoint union of copies of a finite set of graphs. The talk is based o
 n joint work with M. Bayer and B. Goeckner.\n
LOCATION:https://researchseminars.org/talk/CJCS/56/
END:VEVENT
END:VCALENDAR