Font size: Αα Αα Αα hide gadgets
You are here: Defenses » June 2016 » Vasiliki Velona Anonymously browsing from at 15:20:52, 25-04-2019. login
download defense details: { pdf }

MSc thesis defense presentation

Vasiliki Velona defends her MSc thesis.

Date: Friday, 24 Jun 2016
Time: 10:00-11:00
Location: Univeristy of Athens, Department of Mathematics, University of Athens, Α32
Thesis title: Asymptotic analysis of outerplanar graphs with subgraph obstructions

Thesis abstract

In this thesis we study techniques for combinatorial specification and asymptotic enumeration in the context of analytic combinatorics. Our guide through this variety of techniques is the enumeration of certain types of planar graphs, under subgraph exclusion constraints. In particular, we examine outerplanar graphs where the constraint is the exclusion of cycles of certain length. We build specifications for the 2-connected components that exclude certain cycles in order to obtain asymptotics for the general constrainded outerplanar class. The challenges here are combinatorial as well as computational, as the specifications become more involved when the length of the excluded cycle grows and the generating functions obtained are in implicit form. The combinatorial language that we use is the so-called Symbolic Method that comes in hand with corresponding analytic techniques. Furthermore, we study certain parameters of general outerplanar graphs, namely the number of triangles and quadrangles. We obtain Gaussian limiting distibutions and extract explicit constants for the mean and variance.


Page updates

No recent updates.

Feeds RSS and Atom feeds

all posts RSS
news RSS
announcements RSS
website news RSS
all events RSS
defenses RSS
exams RSS
seminars RSS
graduations RSS
Web standards: XHTML1.0, CSS3.
© 1996 – 2019 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.