A class of dimension-skipping graphs

DOI10.1007/BF02579142MaRDI QIDQ761472zbMATH OpenOpenAlexFDO

Authors Igor Kriz

Publication date 1984

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02579142

zbMATH Keywords

dimension of a graph

Mathematics Subject Classification ID

Graph theory (05C99)

Review text

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.

Recommendations

• The dimension of a graph
• The dimension of a graph
• On the dimension of a graph
• Embedding graphs in Euclidean space
• Embeddings of graphs in Euclidean spaces

Cites work

• A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
• On a product dimension of graphs

Cited in

(1)

• The dimension of a graph

This page was built for publication: A class of dimension-skipping graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761472)