Here it is proved that for almost all simple graphs over n vertices one needs Ω(n4/3(log n)−4/3) extra vertices to obtain them as a double competition graph of a digraph. on the other hand O(n5/3) extra vertices are always sufficient. Several problems remain open.
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics