具有6个顶点且匹配数为1的极值3-一致超图的结构

Structure of 3-uniform extremal hypergraphs with 6 vertexes and 1-matching

设H为一个具有6个顶点且匹配数为1的极值3-一致超图,由生成函数法确定了根序列的数目,进一步确定了极图同构类的总数为13,并详尽描述了各类极图的结构.

Let H be a 3-uninform extremal hypergraph with 6 vertexes and 1 -matching. By the method of generating function, the number of root sequence is determined, and then it is proved that the extremal hypergraphs have 13 isomorphic objects totally, and the structures of extremal hypergraphs are described at full length.