关于不含$K_{2,2}$的二部图的CNF-复杂性
On the CNF-complexity of bipartite graphs containing no $K_{2,2}$'s
摘要:
通过概率构造,我们找到了一个具有平均度$d$的二部图,它可以用$C \log d$子句表示为合取范式。这与Jukna的研究问题1.33相矛盾。
英文摘要:
By a probabilistic construction, we find a bipartite graph having average degree $d$ which can be expressed as a conjunctive normal form using $C \log d$ clauses. This contradicts research problem 1.33 of Jukna.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。