A lower bound for the interval number of a graph

摘要

The interval number i(G) of a graph G with n vertices is the lowest integer m such that G is the intersection graph of some family of sets I1,…,In with every Ii being the union of at most m real intervals. In this article a lower bound for i(G) is proved followed by some considerations about the construction of graphs that are critical with respect to the interval number.