摘要
概率方法是解决离散数学中许多问题的强有力工具,它在超图着色问题中有着重要的应用,Erds[1]和Beck[2]利用概率方法研究不具备特征B的n-一致超图的边的最小可能数m(n),得到了有关m(n)的下界.利用概率方法研究m(n)的上界,得到了有关m(n)的一个上界.
The probabilisfic method is a powerful tool for solving discrete mathematic problems, they have many important applications in hypergragh. By means of the probabilistic method, Erdtisand and Beck obtain lower bounds of m ( n ) by using the minimum possible number of an n-uniform hypergragh that does not havproperty B. The paper studies the upper bound through upper bound of probabilistic method.
出处
《华东交通大学学报》
2008年第2期68-69,共2页
Journal of East China Jiaotong University
关键词
概率方法
超图
上界
probabilistie method
hypergragh
upper bound