The Triangle Intersection Problem For Hexagon Triple Systems
Metadata Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lindner, Charles C. | |
dc.contributor.advisor | Jenda, Overtoun | en_US |
dc.contributor.advisor | Hoffman, Dean | en_US |
dc.contributor.author | Pettis, Carl | en_US |
dc.date.accessioned | 2008-09-09T21:15:55Z | |
dc.date.available | 2008-09-09T21:15:55Z | |
dc.date.issued | 2006-08-15 | en_US |
dc.identifier.uri | http://hdl.handle.net/10415/274 | |
dc.description.abstract | The 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.iso | en_US | en_US |
dc.subject | Mathematics and Statistics | en_US |
dc.title | The Triangle Intersection Problem For Hexagon Triple Systems | en_US |
dc.type | Dissertation | en_US |
dc.embargo.length | NO_RESTRICTION | en_US |
dc.embargo.status | NOT_EMBARGOED | en_US |