𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The order dimension of the complete graph

✍ Scribed by Serkan Hoşten; Walter D. Morris Jr.

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
335 KB
Volume
201
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We show that the order dimension of the complete graph on n vertices is the smallest integer t for which there are n antichains in the subset lattice of It -1] that do not contain [t -1] or two sets whose union is [t-1].

📜 SIMILAR VOLUMES

The frame dimension and the complete ove
The frame dimension and the complete overlap dimension of a graph
✍ Jeffrey E. Steif 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB

Roberts (F. S. Roberts, On the boxicity and cubicity of a graph. In Recent Progress in Cornbinarorics, W. T. Tutte, ed. Academic, New York (1 969)), studied the intersection graphs of closed boxes (products of closed intervals) in Euclidean n-space, and introduced the concept of the boxicity of a gr

On the euclidean dimension of a complete
On the euclidean dimension of a complete multipartite graph
✍ Hiroshi Maehara 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 272 KB

The euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can be placed in euclidean n-space, R", in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances other than 1. Let G = K(n,, . , ns+,+J be a complete (s + t + u)-partite graph

The rotational dimension of a graph
The rotational dimension of a graph
✍ Frank Göring; Christoph Helmberg; Markus Wappler 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB
The circular dimension of a graph
The circular dimension of a graph
✍ Robert B. Feinberg 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A graph is a pair (V, I), V being the vertices and I being the relation of adjacency on V. Given a grqh G, then a collection of functions (fi}~ ,, each fi mapping each vertex of V into an arc on a fixed circle, is said to define an m-arc intersection model for G if for all x, y E V, xly e=, (Vi~ml(f

Vertex dimension of complete graphs on e
Vertex dimension of complete graphs on even vertices
✍ Hirofumi Nagasaka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 551 KB

In this paper we study the flat maps from a finile graph G to a Euclidean space I? that were recentlq defined and studied in [4]. We define the vertex dimension of a finite graph and give some necessary conditions for a polygonal map to be flat. As a result we show that the vertex dimension of the c