Ostatnia aktualizacja:
October 10. 2018 21:57:17
Strona główna > Aktualny program seminarium

Aktualny program seminarium

Plan referatów może ulec zmianie. Jeśli chcesz otrzymywać regularnie aktualny plan referatów to napisz do sekretarza seminarium.


17.10
Paweł Rzążewski
Drawing graphs and hypergraphs in 3d

Streszczenie:
Abstrakt: By Fáry's theorem, every planar graph has a non-crossing embedding in the plane, in which every edge is drawn as a straight-line segment. On the other hand, it is well-known that every graph has a non-crossing straight-line embedding in 3d. I will survey some questions and results concerning drawing graphs in 3d. Then I will show some new results, concerning representing graphs and their dual hypergraphs by convex polygons in 3d.

The new results are obtained with William Evans, Chan-Su Shin, Noushin Saeedi, and Alexander Wolff.