A note on circular dimension

✍ Scribed by J.B. Shearer

• Publisher: Elsevier Science
• Year: 1980
• Tongue: English
• Weight: 92 KB
• Volume: 29
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(90)90290-x

✦ Synopsis

In [l] Feinberg conjectures that the maximum circular dimension of all graphs having n vertices is attained by a complete partite graph. In this note we show that this is not so.

In [l], Feinberg defined the circular dimension of a graph as follows: Given a graph G = (V, E), a collection of functions {fi}; 1, each fi mapping each vertex of G into an arc on a fixed circle, defines an m-arc intersection model for G if for X, YE v: