Dvojpokrytí cykly a náhodná vnoření grafů

• Thesis title in Czech: Dvojpokrytí cykly a náhodná vnoření grafů
• Thesis title in English: Cycle double covers and random embeddings of graphs
• Key words: graf|cyklus|náhodné vnoření
• English key words: graph|cycle|random embedding
• Academic year of topic announcement: 2021/2022
• Thesis type: dissertation
• Thesis language: čeština
• Department: Computer Science Institute of Charles University (32-IUUK)
• Supervisor: doc. Mgr. Robert Šámal, Ph.D.
• Author: hidden - assigned and confirmed by the Study Dept.
• Date of registration: 06.11.2021
• Date of assignment: 06.11.2021
• Confirmed by Study dept. on: 11.11.2021

Guidelines

Cycle double covers and related question are a classical part of graph theory.
Random embeddings of graphs is a less developed notion that is getting more
attention recently. The student will study these areas and connections between them.

References

Cun-Quan Zhang: Circuit Double Cover of Graphs. London Mathematical Society Lecture Note Series: 399, 2012.
Saul Stahl. On the average genus of the random graph. J. Graph Theory, 20(1):1–18, 1995.
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík, Bojan Mohar, and Robert Šámal. Random 2-cell embeddings of multistars, arXiv:2103.05036

Current research literature.