We shall consider partitions of the edges of graphs and hypergraphs . 我们将考虑图和超图的边的划分。
Hypergraphs are the generalization of graphs 超图是图的重要的推广。
The counting series for acyclic linear homeorphically k irreducible hypergraphs 不可约超图的计数
In this thesis the relations among the parameters of hypergraphs and colourings of hypergraphs are discussed . this thesis consists of four chapters 本学位论文主要讨论超图中各参数间的关系以及超图的边色数问题,全文分4章。
The domination sets and perfect domination sets in hypergraphs are researched , and the conditions of sufficient and necessary of domination sets and perfect domination sets are given 摘要研究超图的控制集和完美控制集并给出超图的控制集和完美控制集存在的充分必要条件。
Markov ' s inequality and four kinds of lovasz local lemma , and give different applications in hypergraphs with these probabilistic methods , we find different conditions for a hypergraph to be 2 - colorable with some kinds of thinkings ) sz局部引理的内容,给出了这几种概率方法在超图上的应用,用几种思路找到了超图存在2 -可染色的不同条件,其中着重对一般形式的lov (