Geodesic
On minimal n-universal graphs
Glasgow mathematical journal, Tome 7 (1965) no. 1, pp. 32-33

Voir la notice de l'article provenant de la source Cambridge University Press

A graph Gn consists of n distinct vertices x1x2, ..., xn some pairs of which are joined by an edge. We stipulate that at most one edge joins any two vertices and that no edge joins a vertex to itself. If xi, and xj are joined by an edge, we denote this by writing xi ∘ xj.Consider a second graph HN, where n ≦ N. Following Rado [1], we say that a one-to-one mapping/of the vertices of Gn into the vertices of HN defines an embedding if xi ∘ xj implies f(xi) ∘ f(xj), and conversely, for all i, j = 1, 2,..., n. If there exists an embedding of Gn into HN, we denote this by writing Gn <HN. The particular graph HN is said to be n-universal if Gn < HN for every graph Gn with n vertices. 
Moon, J. W. On minimal n-universal graphs. Glasgow mathematical journal, Tome 7 (1965) no. 1, pp. 32-33. doi: 10.1017/S2040618500035139
@article{10_1017_S2040618500035139,
     author = {Moon, J. W.},
     title = {On minimal n-universal graphs},
     journal = {Glasgow mathematical journal},
     pages = {32--33},
     year = {1965},
     volume = {7},
     number = {1},
     doi = {10.1017/S2040618500035139},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S2040618500035139/}
}
TY  - JOUR
AU  - Moon, J. W.
TI  - On minimal n-universal graphs
JO  - Glasgow mathematical journal
PY  - 1965
SP  - 32
EP  - 33
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S2040618500035139/
DO  - 10.1017/S2040618500035139
ID  - 10_1017_S2040618500035139
ER  - 
%0 Journal Article
%A Moon, J. W.
%T On minimal n-universal graphs
%J Glasgow mathematical journal
%D 1965
%P 32-33
%V 7
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S2040618500035139/
%R 10.1017/S2040618500035139
%F 10_1017_S2040618500035139

[1] 1.Rado, R., Universal graphs, Ada Arith. (to appear). Google Scholar

Cité par Sources :