主要包含Ramsey图的短表的有效构造
On efficient constructions of short lists containing mostly Ramsey graphs
摘要:
概率方法最早和最著名的应用之一是证明2 log n$-Ramsey图的存在性,即,一个有n个节点的图,不包含大小为2 log n的团或独立集。这种图的显式构造是一个主要的开放问题。我们表明,一个合理的硬度假设意味着在多项式时间可以构建一个列表包含polylog(n)图,使他们中的大多数是2 log n-Ramsey。
英文摘要:
One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 log n$-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 log n. The explicit construction of such a graph is a major open problem. We show that a reasonable hardness assumption implies that in polynomial time one can construct a list containing polylog(n) graphs such that most of them are 2 log n-Ramsey.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。