Év szerint Hónap szerint Ugrás a hónaphoz

Éva Czabarka (University of South Carolina): A tanglegram Kuratowski theorem

iCal fájl letöltése
Péntek, 8. December 2017, 15:00 - 16:00
Abstract. A tanglegram consists of two rooted binary plane trees with the same number
of leaves and a perfect matching between the two leaf sets. Tanglegrams are drawn with
the leaves on two parallel lines, the trees on either side of the strip created by these lines, and the perfect matching inside the strip. If this can be done without any edges crossing, a tanglegram is called planar. We show that every non-planar tanglegram contains one of two non-planar 4-leaf tanglegrams as induced subtanglegram, which parallels Kuratowski’s Theorem.
Hely : Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged


JEvents v3.1.8 Stable   Copyright © 2006-2013