Isomorphism and embedding problems for infinite limits of scale-free graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.04 |
Let n,t be positive integers. A t-edge-colored graph G is (n,t)-e.c. or (n,t)-existentially closed if for any t disjoint sets of vertices A"1,...,A"t with |A"1|+...+|A"t|=n, there is a vertex x not in A"1@?...@?A"t such that all edges from this vertex to the set A"i are colored by the i-th color. In this paper, we give an explicit construction of a (3,t)-e.c. graph of polynomial order.