Degree Sequence Of Hypergraph

In this paper,some results and reseaching condition of degree sequence of hypergraph are introduced in preface.In the first section , the definition of parasimple hypergraph and the sufficient and necessary condition of degree sequences of parasimple hypergraph are given, For the situation of r-uniformal simple hypergraph are simple hypergraph, degree sequences of r-uniformal simple hypergraph is solved at same time. Then the sufficient and necessary condition of degree sequence of connective parasimple hypergraph (r-uniformal simple hypergraph) are given.In the second section, we receive another sufficient and necessary conditions of degree sequences of parasimple hypergraph by majorized-relation: the positive integer sequence S = (s₁, S₂,…,s_n), (s_i≤s_i+1) is degree sequence of some (connective)k-uniformal simple hypergraph , iff exists k simple (connective) hypergraph H,with degree sequences S' = (s'₁,s'₂,…s'_n),(s'_i≤s'_i+1),S(?)S'.In the third section,the sufficient and necessary conditions of degree sequences of k-hyper rotational tournaments are given: n > k≥4, S⁰ = (s₁⁰, s₂⁰,…, s_n⁰) is a no reduce positive integer sequence ,for r sat- isfied and(only and)r = n thenS⁰ is a degree sequence of some (connective) k-hyper rotational tournamentsAt last, some open problems and further reseaching works are given.