顶点数至少为$2\ell+1$的无圈图是$\ell$ -可识别的
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable
摘要:
一个$n$ -顶点图的$(n-\ell)$ -甲板是从它删除$\ell$顶点得到的子图的多重集.一类$n$ -顶点图是$\ell$ -可识别的,如果每个具有与该图族中的图相同的$(n-\ell)$ -deck的图也在该图族中.证明了当$n\ge2\ell+1$(除$(n,\ell)=(5,2)$外)为$n$时,$n$ -顶点图族是$\ell$ -可识别的.已知当$n=2\ell$。
英文摘要:
The $(n-\ell)$-deck of an $n$-vertex graph is the multiset of subgraphs obtained from it by deleting $\ell$ vertices. A family of $n$-vertex graphs is $\ell$-recognizable if every graph having the same $(n-\ell)$-deck as a graph in the family is also in the family. We prove that the family of $n$-vertex graphs having no cycles is $\ell$-recognizable when $n\ge2\ell+1$ (except for $(n,\ell)=(5,2)$). It is known that this fails when $n=2\ell$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。