Hereditary Properties of Ordered Graphs
Hereditary Properties of Ordered Graphs
复制标题
有序图的遗传性质
DOI：
10.1007/3-540-33700-8_12
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
R. Morris
中科院分区：
文献类型：
--
作者：
J. Balogh;B. Bollob'as;R. Morris
有序图是顶点上有线性顺序的图。有序图的遗传性质是取顶点集的保序同构封闭的有序图和保序诱导子图的集合。如果P是有序图的遗传性质，则pn表示集合\( \left\{ {G \in \mathcal{P}:V(G) = [n]} \right\} \)，函数\( n \mapsto \left| {\mathcal{P}_n } \right| \)称为P的速度。
An ordered graph is a graph together with a linear order on its vertices. A hereditary property of ordered graphs is a collection of ordered graphs closed under taking order-preserving isomorphisms of the vertex set, and order-preserving induced subgraphs. If P is a hereditary property of ordered graphs, then P n denotes the collection \( \left\{ {G \in \mathcal{P}:V(G) = [n]} \right\} \), and the function \( n \mapsto \left| {\mathcal{P}_n } \right| \) is called the speed of P.