A class of dimension-skipping graphs
type: Item
instance of: scholarly article
title: A class of dimension-skipping graphs
zbMATH Open document ID: 0556.05057
DOI: 10.1007/BF02579142
published in: Combinatorica
publication date: 1984-01-01T00:00:00Z
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.
reviewed by: Peter Horák
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3885964
zbMATH Keywords: dimension of a graph
author: Igor Kriz
MaRDI profile type: Publication
cites work: On a product dimension of graphs
cites work: A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
full work available at URL: https://doi.org/10.1007/bf02579142
OpenAlex ID: W1530042976
description: scientific article; zbMATH DE number 3885964