Abstarct: In this dissertation, we introduced some new hypergraph homorphism-monotone parameters. Using this parameters, we investigate the existence of hypergraph homomorphism between two hypergraphs. In this regard, introducing some new necessary conditions for the existence of hypergraph homomorphism, we improve upon some coloring hypergraphs results and also present some new results in this area. In particular, generalizing a result for Kneser graphs, we prove that the chromatic number and circular chromatic number of generalized Kneser hypergraphs are equal if its number of vertices is sufficiently large..