This Is AuburnElectronic Theses and Dissertations

Show simple item record

The Triangle Intersection Problem For Hexagon Triple Systems


Metadata FieldValueLanguage
dc.contributor.advisorLindner, Charles C.
dc.contributor.advisorJenda, Overtounen_US
dc.contributor.advisorHoffman, Deanen_US
dc.contributor.authorPettis, Carlen_US
dc.date.accessioned2008-09-09T21:15:55Z
dc.date.available2008-09-09T21:15:55Z
dc.date.issued2006-08-15en_US
dc.identifier.urihttp://hdl.handle.net/10415/274
dc.description.abstractThe Triangle Intersection Problem for Hexagon Triple Systems Carl S. Pettis, Auburn University A hexagon triple is the graph and a hexagon triple system is an edge disjoint decomposition of 3kn into hexagon triples. Note that a hexagon triple is the union of 3 triangles (= triples). The intersection problem for 3-fold triple systems has been solved for some time now. The purpose of this paper is to give a complete solution of the intersection problem for 3-fold triple systems each of which can be organized into hexagon triple systems.en_US
dc.language.isoen_USen_US
dc.subjectMathematics and Statisticsen_US
dc.titleThe Triangle Intersection Problem For Hexagon Triple Systemsen_US
dc.typeDissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record