BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Sandra Kingan (Brooklyn College (CUNY))
DTSTART:20200604T190000Z
DTEND:20200604T192500Z
DTSTAMP:20260423T011238Z
UID:CANT2020/53
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/53/
 ">$H$-critical graphs</a>\nby Sandra Kingan (Brooklyn College (CUNY)) as p
 art of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstract\
 nWe are interested in the class of 3-connected graphs with a minor isomorp
 hic to a specific 3-connected \ngraph $H$. A 3-connected graph is minimall
 y 3-connected if deleting any edge destroys 3-connectivity. \nSuppose that
  $G$ is a simple 3-connected graph with a simple 3-connected minor $H$.  \
 nWe say $G$ is $H$-critical\, if deleting any edge either destroys 3-conne
 ctivity or the $H$-minor. \nIf $H$ is minimally 3-connected\, then $G$ is 
 also minimally 3-connected\, and the class of $H$-critical \ngraphs is the
  class of minimally 3-connected graphs with an $H$ minor. \nIn general\, h
 owever\, $H$ is not minimally 3-connected\, and in this case $H$-critical 
 graphs are not \nminimally 3-connected graphs. Yet we have obtained splitt
 er-type structural results for $H$-critical graphs \nthat are very similar
  to Dawes' result on the structure of minimally 3-connected graphs. \nWe a
 lso get a result that is very similar to Halin's bound on the size of mini
 mally 3-connected graphs. \nI will present these results in this talk. The
  results are joint work with Joao Paulo Costalonga.\n
LOCATION:https://researchseminars.org/talk/CANT2020/53/
END:VEVENT
END:VCALENDAR