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 talks are now also available online : https://webconf.u-bordeaux.fr/b/mar-ef4-zed.

Vendredi 20 mai 14h - Alexandra Wesolek
On asymptotic packing of geometric graphs
Only offline, no online version

A geometric graph G is a graph drawn in the Euclidean plane such that its vertices are points in general position and its edges are drawn as straight line segments. Given a complete geometric graph H_n on n vertices, we are interested in finding a large collection of plane copies of a graph G in H_n such that each edge of H_n appears in at most one copy of G. We say a graph G is geometric-packable if for every sequence of geometric complete graphs $(H_n)_{n \geq 1}$ all but o(n^2) edges of H_n can be packed by plane copies of G. In a joint work with Daniel W. Cranston, Jiaxi Nie and Jacques Verstraete, we study geometric-packability and show that if G is a triangle, plane 4-cycle or plane 4-cycle with a chord, the set of plane drawings of G is geometric-packable. In contrast, the analogous statement is false when G is nearly any other planar Hamiltonian graph (with at most 3 possible exceptions).

Jobs

Group

GT Graphs and Optimization

History

 Previous Years

edit SideBar

Blix theme adapted by David Gilbert, powered by PmWiki