Non 3-choosable bipartite graphs and the Fano plane

Files

DMS 854.pdf (907.23 KB)

Date

2010-05-11T20:15:38Z

Authors

Fitzpatrick, Shannon L.
MacGillivray, Gary

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

It is known that the smallest complete bipartite graph which is not 3-choosable has 14 vertices. We show that the extremal configuration is unique.

Description

Keywords

technical reports (mathematics and statistics)

Citation

URI

http://hdl.handle.net/1828/2746

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.