arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.4953math.COcs.DM
收藏

用次线性Hadwiger数构造稠密图

Constructing dense graphs with sublinear Hadwiger number

Jacob Fox

摘要:

马德尔要求明确构建稠密图的最大团未成年人的大小是次线性的顶点数。这样的图作为随机图存在,几乎必然具有这个性质。这个问题和变体被Mrsason在几篇文章中推广。我们回答这些问题,展示如何明确地构建这样的图形使用爆破的小图与此属性。这导致了研究的一个分数变量的团未成年人的数量,这可能是独立的利益。

英文摘要:

Mader asked to explicitly construct dense graphs for which the size of the largest clique minor is sublinear in the number of vertices. Such graphs exist as a random graph almost surely has this property. This question and variants were popularized by Thomason over several articles. We answer these questions by showing how to explicitly construct such graphs using blow-ups of small graphs with this property. This leads to the study of a fractional variant of the clique minor number, which may be of independent interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑