论文标题
最大置换图边缘数的新界限
New bounds on the number of Edges of the maximal Permutation Graphs
论文作者
论文摘要
在本文中，我们将最大置换图的边缘数与N顶点结合。我们提出了一种新方法，通过将边缘的标记集分为六个部分来计算下限，考虑到每个部分的一个单独问题，明确确定四个部分的基数，并总结相应的值。我们以最大置换图的边缘数量的上限结束。
In this paper, we bound the number of edges of a maximal permutation graph with n vertices. We propose a new method to compute the lower bound by splitting the set of labellings of the edges into six parts, considering one separate problem for each part, explicitly determining the cardinality of four parts and summing up the corresponding values. We finish with an upper bound of the number of edges of a maximal permutation graph.
