Unit:
Department of Informatics and TelecommunicationsΠληροφορική
Author:
APOSTOLOU FILIPPOS
Supervisors info:
Αρχοντία Γιαννοπούλου, Επίκουρη Καθηγήτρια, Τμήμα Πληροφορικής και Τηλεπικοινωνιών, Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών
Original Title:
Η ιδιότητα Erdős Pósa για κύκλους
Translated title:
The Erdős Pósa property for cycles.
Summary:
Packing and covering of combinatorial structures of graphs are of major importance in Graph Theory and Theoretical Computer Science. In this project, we will examine the publication that sparked interest in this field of study and supplement it with new research. The method used in this proof is referred to as probabilistic and was formed by the author himself.
Main subject category:
Technology - Computer science
Keywords:
Graph, ErdősPósa property, indipendent circuits, duality, packing, covering, Feedback Vertex Set
