超模式与泛点集
Superpatterns and Universal Point Sets
摘要:
一个古老的开放式问题,在图形绘制要求的大小,一组点,可以作为顶点的直线图的所有n-顶点平面图。我们将这个问题与排列模式的理论联系起来,其中另一个悬而未决的问题涉及超模式的大小,即包含给定大小的所有模式的排列。我们将超模式推广到由禁止模式决定的排列类,并为213-避免排列构造了大小为n^2/4 + Theta(n)的超模式,这是已知无约束排列超模式大小的一半。我们使用我们的超模式来构造大小为n^2/4 - Theta(n)的普适点集,比之前的边界小9/16倍。我们证明了213-避免排列的每个真子集都具有大小为O(n log^O(1)n)的超模式,我们用它来证明有界路宽的平面图具有近线性泛点集。
英文摘要:
An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices for straight-line drawings of all n-vertex planar graphs. We connect this problem to the theory of permutation patterns, where another open problem concerns the size of superpatterns, permutations that contain all patterns of a given size. We generalize superpatterns to classes of permutations determined by forbidden patterns, and we construct superpatterns of size n^2/4 + Theta(n) for the 213-avoiding permutations, half the size of known superpatterns for unconstrained permutations. We use our superpatterns to construct universal point sets of size n^2/4 - Theta(n), smaller than the previous bound by a 9/16 factor. We prove that every proper subclass of the 213-avoiding permutations has superpatterns of size O(n log^O(1) n), which we use to prove that the planar graphs of bounded pathwidth have near-linear universal point sets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。