Extremal graphs of order dimension 4

Authors

  • Geir Agnarsson

DOI:

https://doi.org/10.7146/math.scand.a-14358

Abstract

We study the maximal number of edges of a graph on $p$ vertices of order dimension 4. We will show that the lower bound for this number is greater than $\frac{3}{8}p^{2} + 2p - 13$. In particular the Turn-4 graph on $p$ vertices does not have the maximal number of edges among the graphs of order dimension 4.

Downloads

Published

2002-03-01

Issue

Vol. 90 No. 1 (2002)

Section

Articles

How to Cite

[1]
G. Agnarsson, “Extremal graphs of order dimension 4”, Math. Scand., vol. 90, no. 1, pp. 5–12, Mar. 2002, doi: 10.7146/math.scand.a-14358.