Title of article
On the double competition number
Author/Authors
Zoltan Furedi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
5
From page
251
To page
255
Abstract
It is known, that for almost alln-vertex simple graphs one needs Ω(n43(log n)−43) extra vertices to obtain them as a double competition graph of a digraph. In this note a construction is given to show that 2n43 are always sufficient.
Keywords
Clique covers , Random graphs , Competition graphs
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884716
Link To Document