User Tools

Site Tools


Garry Bowlin (Binghamton)

Intrinsic Chirality of 3-Connected Graphs

Abstract for the Combinatorics Seminar 2006 February 16

A graph is called chiral if there is no orientation-reversing self-homeomorphism of S3 that carries the graph onto itself. 3-Connected graphs are characterized as intrinsically chiral (or not) in terms of whether or not certain types of graph automorphism exist.

This talk is based on a paper by Erica Flapan and Nikolai Weaver.

seminars/comb/abstract.200602bow.txt · Last modified: 2020/01/29 14:03 (external edit)