Tomaž Pisanski: Incidence species and their representations
Datum objave: 19. 3. 2013
Seminar za teorijo grafov in algoritme
Četrtek 21. 3. 2013 ob 12:15 v PS na Jadranski 19.
The main goal of my lecture is to introduce the notion of incidence species and to discuss various mappings between them - called representations. In particular, we would like to show that any combinatorial incidence structure can be realized with quasi-lines in the extended Euclidean plane. The notions of sweep lines and wiring diagrams are used in the proof. If time permits a method for constructing isometric point-circle configurations from unit-distance graphs will be presented. This is taken from a joint work in progress with Gábor Gévay, Leah Berman and Jûrgen Bokowski.