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. / May 2016
| Identifer | oai:union.ndltd.org:MANITOBA/oai:mspace.lib.umanitoba.ca:1993/31220 |
| Date | 13 April 2016 |
| Creators | Zou, Yangsheng |
| Contributors | Kocay, William (Computer Science), Li, Ben (Computer Science) Van Rees, John (Computer Science) Gunderson, David(Mathematics) |
| Source Sets | University of Manitoba Canada |
| Detected Language | English |
Page generated in 0.0087 seconds