Let H and J1 be both t-uniform hypergraphs. Let J2 be a sub-hypergraph of J1. In this paper, the metamorphosis of a hypergraph decomposition is introduced, denoted by (H, J1 】 J2)-design, which is a generalization of...Let H and J1 be both t-uniform hypergraphs. Let J2 be a sub-hypergraph of J1. In this paper, the metamorphosis of a hypergraph decomposition is introduced, denoted by (H, J1 】 J2)-design, which is a generalization of the concept of metamorphosis of a graph decomposition. Let Meta(J1】J2) denote the set of all integers v such that there exists a (Kv((3)), J1】J2)-design. We completely determine the set Meta(K4((3))】K4((3))-e).展开更多
基金supported by National Natural Science Foundation of China (Grant Nos.10771013, 10901016) and by Prin, Pra and Indam (GNSAGA)
文摘Let H and J1 be both t-uniform hypergraphs. Let J2 be a sub-hypergraph of J1. In this paper, the metamorphosis of a hypergraph decomposition is introduced, denoted by (H, J1 】 J2)-design, which is a generalization of the concept of metamorphosis of a graph decomposition. Let Meta(J1】J2) denote the set of all integers v such that there exists a (Kv((3)), J1】J2)-design. We completely determine the set Meta(K4((3))】K4((3))-e).