Note
The elimination procedure for the competition number is not optimal

https://doi.org/10.1016/j.dam.2005.11.009Get rights and content
Under an Elsevier user license
open archive

Abstract

Given an acyclic digraph D, the competition graph C(D) is defined to be the undirected graph with V(D) as its vertex set and where vertices x and y are adjacent if there exists another vertex z such that the arcs (x,z) and (y,z) are both present in D. The competition number k(G) for an undirected graph G is the least number r such that there exists an acyclic digraph F on |V(G)|+r vertices where C(F) is G along with r isolated vertices. Kim and Roberts [The Elimination Procedure for the Competition Number, Ars Combin. 50 (1998) 97–113] introduced an elimination procedure for the competition number, and asked whether the procedure calculated the competition number for all graphs. We answer this question in the negative by demonstrating a graph where the elimination procedure does not calculate the competition number. This graph also provides a negative answer to a similar question about the related elimination procedure for the phylogeny number introduced by the current author in [S.G. Hartke, The Elimination Procedure for the Phylogeny Number, Ars Combin. 75 (2005) 297–311].

MSC

05C20
68R10

Keywords

Competition graph
Competition number
Elimination procedure
Phylogeny graph
Phylogeny number

Cited by (0)

Supported in part by a National Defense Science and Engineering Graduate Fellowship and National Science Foundation Grants EIA 0205116, DBI 9982983, and SBR 9709134.