BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ruy Fabila Monroy (Cinvestav)
DTSTART:20220922T141500Z
DTEND:20220922T160000Z
DTSTAMP:20260422T065509Z
UID:CJCS/85
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/85/">To
 ken graph reconstruction in Diamond and C_4 free graphs</a>\nby Ruy Fabila
  Monroy (Cinvestav) as part of Copenhagen-Jerusalem Combinatorics Seminar\
 n\n\nAbstract\nLet G be a graph on n vertices and 0< k <n be an integer. T
 he k-token graph\nF_k(G) is the graph whose vertex set are all the k-subse
 ts of vertices of G\, two of which are\nadjacent when their symmetric diff
 erence is an edge of G. An open problem is whether \nthe token graph deter
 mines G. That is\, if F_k(G) is isomorphic to F_k(H)\, does this imply\nth
 at G and H are isomorphic. In this talk we show that this is the case for 
 diamond and C_4 free\nconnected graphs. We also introduce a notion of when
  a graph is uniquely reconstructible from its token graph\;\nand show how 
 this notion is related to the automorphism groups of G and F_k(G).\n
LOCATION:https://researchseminars.org/talk/CJCS/85/
END:VEVENT
END:VCALENDAR