 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 |