A class of dimension-skipping graphs
Let G be a graph. Then the dimension of G, denoted by dim(G), is the least number n such that G is embeddable into \(\prod^{n}_{i=1}G_ i\), where \(G_ i\) is a complete graph, \(i=1,2,...,n\). The main result of the paper is: Theorem. For \(n\geq 6\) there exists a graph G such that \(\dim (G)=n\) and \(\dim (G+x)\geq n+2,\) for a suitable edge x.
scientific article; zbMATH DE number 3885964