The Degree Sequence Problem for 3-Hypergraphs
| dc.contributor.author | Zou, Yangsheng | |
| dc.contributor.examiningcommittee | Li, Ben (Computer Science) Van Rees, John (Computer Science) Gunderson, David(Mathematics) | en_US |
| dc.contributor.supervisor | Kocay, William (Computer Science) | en_US |
| dc.date.accessioned | 2016-04-13T20:58:27Z | |
| dc.date.available | 2016-04-13T20:58:27Z | |
| dc.date.issued | 2016 | |
| dc.degree.discipline | Computer Science | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | Currently the degree sequence problem for 3-hypergraphs is still unsolved efficiently. This paper researches the 3-hypergraphic problem in terms of edge switching and exchanges in the sequence to implement Dewdney’s reduction. It proposes the idea of an irreducible decomposition and makes use of it to find some sufficient conditions for a 3-hypergraphic sequence. In addition, this paper explores a related problem: intersection preserving mappings. | en_US |
| dc.description.note | May 2016 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1993/31220 | |
| dc.language.iso | eng | en_US |
| dc.rights | open access | en_US |
| dc.subject | 3-hypergraphic problem, Irreducible decomposition, Intersection preserving mapping | en_US |
| dc.title | The Degree Sequence Problem for 3-Hypergraphs | en_US |
| dc.type | master thesis | en_US |