BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:e8db72ea-77d5-4edf-8c7f-59225bc1ce17
X-WR-CALNAME:[gt.go] - 'Weakly sparse and strongly flip-flat classes of gra
 phs are almost-wide' by Fatemeh Ghasemi
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20271031T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20251026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20261025T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20260329T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20270328T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:e8db72ea-77d5-4edf-8c7f-59225bc1ce17
DTSTAMP:20260504T200756Z
CLASS:PUBLIC
DESCRIPTION:Strong flip-flatness has emerged as a natural dense analogue of
  uniform almost-wideness in the context of preservation theorems\, but its
  combinatorial meaning is still not fully understood. In this paper\, we s
 tudy strongly flip-flat graph classes under a weak sparsity assumption\, n
 amely the exclusion of a fixed biclique as a subgraph. Our main result sho
 ws that a graph class is weakly sparse and strongly flip-flat if and only 
 if it is uniformly almost-wide. The proof transforms bounded families of f
 lips into bounded deletion sets proceeding via an induction on the number 
 of flips rather than on the independence radius. This viewpoint yields a n
 ew connection between flip-based decompositions in dense settings and wide
 ness notions from sparse graph theory. As a consequence\, we obtain a char
 acterization of strongly flip-flat classes inside structurally bounded exp
 ansion classes\, confirming the corresponding case of a broader conjecture
  that strongly flip-flat classes should be exactly the structurally unifor
 mly almost-wide classes. \n\n\n(Fatemeh Ghasemi) [LACL\, Université Paris-
 Est Créteil] \n\n\nVérifiez que vous êtes bien inscrits sur le site du [gd
 r-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes
 /Equipes#membres | https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Eq
 uipes#membres ] \n\nRemarks / Remarques \n\nFind all the information of th
 e working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.ph
 p/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes les informations
  du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Group
 e/GT | page web ] . \n\n\n\nImport automatique depuis https://webmel.u-bor
 deaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.go.ics par sync_icals_to_drupal
 .py pour GT-GO
DTSTART;TZID=Europe/Paris:20260403T150000
DTEND;TZID=Europe/Paris:20260403T160000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Weakly sparse and strongly flip-flat classes of graphs a
 re almost-wide' by Fatemeh Ghasemi
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
