超图同态探究.pdfVIP

[2] – , Æ 1972 Berge[6] 4 r- r- Æ r- χ (H × H ) = min{χ (H ), χ (H )}. s 1 2 s 1 s 2 Æ : ÆÆÆÆ II Abstract Recently, people have paid more and more attention to it — to solve the problems on graph theory by using algebraic method, it has formed a set of theory — Algebraic graph theory[2], and the homomorphism and isomorphism of graph is among it. The homomorphism and isomorphism of graphs are mostly used as tools, especially in connection with coloring problems. Hypergraphs are set systems of finite sets, they are the general struc- ture and play an important role in the discrete mathematics. The isomor- phism of hypergraph has been presented and studied by Berge[6] in 1972, and many results have been obtained, but homomorphism of hypergraph has not been given. In this thesis, we present the homomorphism of hy- pergraph in terms of the homomorphism of graph, and study the problems in connection with hypergraphs and obtain some results. We complete the whole thesis with treatment of problems about the homomorphism of hypergraphs.This thesis consists of four parts. In the first part, we give the conception of the homomorphism of hypergraph and some basic properties, and a basic property about strong chromatic number.