双环图的归纳数的界
Bounds On The Inducibility Of Double Loop Graphs
摘要:
在极图理论中,存在一个问题,即研究$k$-顶点图$H$在任何$n$-顶点图$G$中的最大诱导密度.这就是著名的\emph{inducibility}问题,它是由Pippenger和Golumbic在1975年首次提出的。本文给出了一类$k$阶\emph{Double Loop Graphs}的诱导数的一个新的上界.对于阶数$k=5$获得的上限在精确诱导数的0.964506倍内,对于$k=6$获得的上限在最佳已知下限的3倍内。
英文摘要:
In the area of extremal graph theory, there exists a problem that investigates the maximum induced density of a $k$-vertex graph $H$ in any $n$-vertex graph $G$. This is known as the problem of \emph{inducibility} that was first introduced by Pippenger and Golumbic in 1975. In this paper, we give a new upper bound for the inducibility for a family of \emph{Double Loop Graphs} of order $k$. The upper bound obtained for order $k=5$ is within a factor of 0.964506 of the exact inducibility, and the upper bound obtained for $k=6$ is within a factor of 3 of the best known lower bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。