On the chromatic number of some geometric type Kneser graphs

We estimate the chromatic number of graphs whose vertex set is the set of edges of a complete geometric graph on n points, and adjacency is defined in terms of geometric disjointness or geometric intersection.