Back to Search
Start Over
An explicit construction of -existentially closed graphs.
- Source :
-
Discrete Applied Mathematics . Jul2013, Vol. 161 Issue 10/11, p1651-1654. 4p. - Publication Year :
- 2013
-
Abstract
- Abstract: Let be positive integers. A -edge-colored graph is -e.c. or -existentially closed if for any disjoint sets of vertices with , there is a vertex not in such that all edges from this vertex to the set are colored by the -th color. In this paper, we give an explicit construction of a -e.c. graph of polynomial order. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 161
- Issue :
- 10/11
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 89069693
- Full Text :
- https://doi.org/10.1016/j.dam.2012.12.016