弦图中的近优分离子
Near-optimal separators in string graphs
摘要：
设G是一个有m条边的弦图（平面上连续弧的交图）。Fox和Pach证明了G有一个由O（m^{3/4} \sqrt{log m}）$个顶点组成的分隔符，并证明了O（\sqrt m）的界成立.我们得到了具有O（\sqrt m \log m）个顶点的分离器.
英文摘要：
Let G be a string graph (an intersection graph of continuous arcs in the plane) with m edges. Fox and Pach proved that G has a separator consisting of O(m^{3/4}\sqrt{log m})$ vertices, and they conjectured that the bound of O(\sqrt m) actually holds. We obtain separators with O(\sqrt m \log m) vertices.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
