Groupe

GT

Seminars are given every Friday from 2:00 to 3:00 (usually in room 178, but not for the time being). You are welcome 10 minutes earlier for tea, coffee and cake.

In order to receive the announcements, just send an email to sympa@diff.u-bordeaux.fr with subject "subscribe labri.go-gt Cookie Monster", where Cookie is your first name and Monster your last name.

See the agenda of the seminars: webmel.u-bordeaux.fr/service/user/bf-labri.go@u-bordeaux.fr/gt.html https://webmel.u-bordeaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.go.html; to add it to yours webmel.u-bordeaux.fr/service/user/bf-labri.go@u-bordeaux.fr/gt.ics https://webmel.u-bordeaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.go.ics , or flash the following QRCode:

Next talks:

The online talks are available here : https://webconf.u-bordeaux.fr/b/mar-ef4-zed.

Vendredi 27 janvier ŕ 14h - Fábio Botler
Separating the edges of a graph by a linear number of paths
Connexion: https://webconf.u-bordeaux.fr/b/mar-ef4-zed
A path separates an edge e from an edge f if it contains the former and not the latter. How many paths do we need to separate any edge from any other? This question was first asked by Katona in 2013, in line with the general study of separating systems initiated by Rényi in 1961. In this talk, we show that the answer is linear in the number of vertices, thus confirming a conjecture independently posed by Balogh, Csaba, Martin, and Pluhár and by Falgas-Ravry, Kittipassorn, Korándi, Letzter, and Narayanan. We focus on the proof method and possible extensions.
This is based on joint work with Bonamy, Dross, Naia and Skokan.

Jobs

Group

GT Graphs and Optimization

History

 Previous Years

edit SideBar

Blix theme adapted by David Gilbert, powered by PmWiki