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

最长路和最长圈的横截

Transversals of Longest Paths and Cycles

Dieter Rautenbach, Jean-Sébastien Sereni

摘要:

设G是n阶图。设lpt(G)是G的顶点集X的最小基数,使得X与G的每条最长路相交,并类似地对圈而不是路定义lct(G).本文证明了:当G是连通图时,lpt(G)\leq ceiling(n/4-n^{2/3}/90),当G是2-连通图时,lct(G)\leq ceiling(n/3-n^{2/3}/36),当G是连通圆弧图时,\lpt(G)\leq 3.我们的界限lct(G)改进了早先的结果,Rumassen和我们的界限圆弧图涉及到早先的声明Balister \emph{et al.}的参数包含一个差距。此外,我们还证明了可平面图和有界树宽图的lpt(G)的上界。

英文摘要:

Let G be a graph of order n. Let lpt(G) be the minimum cardinality of a set X of vertices of G such that X intersects every longest path of G and define lct(G) analogously for cycles instead of paths. We prove that lpt(G) \leq ceiling(n/4-n^{2/3}/90), if G is connected, lct(G) \leq ceiling(n/3-n^{2/3}/36), if G is 2-connected, and \lpt(G) \leq 3, if G is a connected circular arc graph. Our bound on lct(G) improves an earlier result of Thomassen and our bound for circular arc graphs relates to an earlier statement of Balister \emph{et al.} the argument of which contains a gap. Furthermore, we prove upper bounds on lpt(G) for planar graphs and graphs of bounded tree-width.

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

↑