BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:585f9cbf-26c6-431c-aa86-c80c24866ee7
X-WR-CALNAME:[gt.go] -  'Graph Irregularity via Edge Deletions' par Clara M
 arcille
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20261025T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20241027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20250330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:585f9cbf-26c6-431c-aa86-c80c24866ee7
DTSTAMP:20260415T070948Z
CLASS:PUBLIC
DESCRIPTION:In graph modification problems\, we want to modify a graph thro
 ugh some operation (e.g. vertex/edge deletion/addition/contraction) to obt
 ain a graph belonging to some specific class of graphs. Here\, we pursue t
 he study of edge-irregulators of graphs\, which were recently introduced i
 n [Fioravantes et al. Parametrised Distance to Local Irregularity. {\it IP
 EC}\, 2024]. \n\nThat is\, we are interested in the parameter $I_e(G)$\, w
 hich\, for a given graph $G$\, denotes the smallest $k \geq 0$ such that $
 G$ can be made locally irregular (\textit{i.e.}\, with no two adjacent ver
 tices having the same degree) by deleting $k$ edges. We exhibit notable pr
 operties of interest of the parameter ${\rm I}_e$\, in general and for par
 ticular classes of graphs. Our investigation leads us to propose a conject
 ure that $I_e(G)$ should always be at most $\frac{1}{3}m+c$\, where $m$ is
  the size of the graph $G$ and $c$ is some constant. We verify this conjec
 ture in the case of paths\, cycles\, trees and complete graphs\, and we pr
 ovide the first step towards proving the conjecture for cubic graphs. Fina
 lly\, we present a linear-time algorithm that computes $I_e(G)$ when $G$ i
 s a tree of bounded maximum degree. \n\n[Clara Marcille] (LaBRI) \nhttps:/
 /www.labri.fr/perso/pmarcille/ \n\nVérifiez que vous êtes bien inscrits su
 r le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pm
 wiki.php/Equipes/Equipes#membres | https://gtgraphes.labri.fr/pmwiki/pmwik
 i.php/Equipes/Equipes#membres ] \n\nRemarks / Remarques \n\nFind all the i
 nformation of the working group on this [ https://graphesetoptimisation.la
 bri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes 
 les informations du GT sur cette [ https://graphesetoptimisation.labri.fr/
 pmwiki.php/Groupe/GT | page web ] . \n\n\n\nImport automatique depuis http
 s://webmel.u-bordeaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.go.ics par sync
 _icals_to_drupal.py pour GT-GO
DTSTART;TZID=Europe/Paris:20250418T140000
DTEND;TZID=Europe/Paris:20250418T150000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] -  'Graph Irregularity via Edge Deletions' par Clara Marcil
 le
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
