ODT - THESIS TOPIC: János Barát: Graph Drawings


	Login Forum Organisation officers member institutions resolutions (in Hung.) by-laws (in Hung.) regulations Doctoral program doctoral schools by institution by research field by number ceased working academic staff member by name by research topic archives thesis topic proposals by doctoral school by research field by research topic supervision of PhD students search students Theses defended by institution by research field by name by date by doctoral school Naturalized degrees by institution by research field by name by date Habilitation presentations by institution by branch of science by name Documents (all in Hung.) public documents news legal backgrounds guidelines Contacts contact details partners

Thesis topic proposal

Graph Drawings

THESIS TOPIC PROPOSAL

Institute: University of Szeged
mathematics and computing
Doctoral School of Mathematics

Thesis supervisor: János Barát
Location of studies (in Hungarian): Bolyai Institute, Faculty of Science and Informatics, University of Szeged, Hungary
Abbreviation of location of studies: MatDI

Description of the research topic:

A graph and its topological embedding in the plane is a graph drawing. What is the maximum number of edges a graph drawing can have if each edge is allowed to have at most k intersection points, and no more edges can be added with this property? Is there a relationship between the chromatic number and the crossing number (the total number of intersections obtained when the graph is drawn in the plane) of a graph? We study questions of this type.

Required language skills: English
Number of students who can be accepted: 1

Deadline for application: 2024-12-31