BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T191335Z
UID:Seminar-dept-381@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20150519T130000
DTEND:20150519T140000
SUMMARY:School Seminar Series
DESCRIPTION:Prof. Shmuel Zaks: Combinatorial and Graph Theoretical results initiated by application areas\n\nIn this self-contained talk I will describe few results, in the area of Combinatorics and Graph Theory,  that were initiated by problems from several application areas. These results are: (1) the use of the Cycle Lemma in deriving statistics about several classes of trees (this includes, as a start, a very simple proof for the Catalan number of binary trees), (2)  a new characterization of tree medians , (3) a result about the volume of discrete spheres, (4) a combinatorial problem that resulted in a paper with Paul Erdős, (5) a geometric characterization of an extension of interval graphs, and (6)  results concerning approximation algorithms for a problem initiated in Optical Networks.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=381
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR