BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jean Cardinal (Université Libre de Bruxelles)
DTSTART:20220630T141500Z
DTEND:20220630T160000Z
DTSTAMP:20260422T065750Z
UID:CJCS/75
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/75/">Di
 ameter estimates for graph associahedra</a>\nby Jean Cardinal (Université
  Libre de Bruxelles) as part of Copenhagen-Jerusalem Combinatorics Seminar
 \n\n\nAbstract\nGraph associahedra are generalized permutohedra arising as
  special cases of nestohedra and hypergraphic polytopes. The graph associa
 hedron of a graph G encodes the combinatorics of search trees on G\, defin
 ed recursively by a root r together with search trees on each of the conne
 cted components of G−r. In particular\, the skeleton of the graph associ
 ahedron is the rotation graph of those search trees. We investigate the di
 ameter of graph associahedra as a function of some graph parameters such a
 s treedepth and treewidth\, and give tight estimates for specific families
  of graphs\, including trivially perfect\, complete split and complete bip
 artite graphs. This is a joint work with Lionel Pournin and Mario Valencia
 -Pabon from Université Sorbonne Paris Nord.\n
LOCATION:https://researchseminars.org/talk/CJCS/75/
END:VEVENT
END:VCALENDAR