ar X iv : 0 90 9 . 53 02 v 1 [ m at h . C O ] 2 9 Se p 20 09 The competition number of a graph with exactly two holes
نویسنده
چکیده
Let D be an acyclic digraph. The competition graph of D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x, v) and (y, v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of G is the smallest number of such isolated vertices. A hole of a graph is a cycle of length at least 4 as an induced subgraph. In 2005, Kim [5] conjectured that the competition number of a graph with h holes is at most h + 1. Though Li and Chang [8] and Kim et al. [7] showed that her conjecture is true when the holes do not overlap much, it still remains open for the case where the holes share edges in an arbitrary way. In order to share an edge, a graph must have at least two holes and so it is natural to start with a graph with exactly two holes. In this paper, the conjecture is proved true for such a graph.
منابع مشابه
Enumerating labeled graphs with a k-cycle
Cayley’s Tree Formula for enumerating labeled trees is well known. In this paper a more general result is presented for graphs with exactly one k-cycle (i.e. cycle on k vertices ).It is proved that for all integers n and k such that (n ≥ k ≥ 3), the number of possible labeled graphs on n vertices that contain exactly one k-cycle is ( n−1 k−1 ) nn−k. 1 ar X iv :0 90 9. 24 00 v1 [ m at h. C O ] 1...
متن کاملar X iv : 0 90 9 . 19 31 v 1 [ m at h . C O ] 1 0 Se p 20 09 BUCHSBAUM * COMPLEXES
We introduce a class of simplicial complexes which we call Buchsbaum* over a field. Buchsbaum* complexes generalize triangulations of orientable homology manifolds. By definition, the Buchsbaum* property depends only on the geometric realization and the field. Characterizations in terms of simplicial and local cohomology are given. It is shown that Buchsbaum* complexes are doubly Buchsbaum. App...
متن کاملar X iv : 0 90 9 . 29 83 v 1 [ m at h . N T ] 1 6 Se p 20 09 COMBINATORIAL IDENTITIES INVOLVING THE MÖBIUS FUNCTION
In this paper we derive some identities and inequalities on the Möbius mu function. Our main tool is phi functions for intervals of positive integers and their unions.
متن کاملar X iv : 0 90 6 . 18 57 v 1 [ m at h . C O ] 1 0 Ju n 20 09 On the circumference , connectivity and dominating cycles
Every 4-connected graph with minimum degree δ and connectivity κ either has a cycle of length at least 4δ − 2κ or has a dominating cycle.
متن کاملar X iv : 0 90 9 . 32 86 v 1 [ m at h . C O ] 1 7 Se p 20 09 O - cycles , vertex - oriented graphs , and the four colour theorem
In 1880, P. G. Tait showed that the four colour theorem is equivalent to the assertion that every 3-regular planar graph without cut-edges is 3-edge-colourable, and in 1891, J. Petersen proved that every 3-regular graph with at most two cut-edges has a 1-factor. In this paper, we introduce the notion of collapsing all edges of a 1-factor of a 3-regular planar graph, thereby obtaining what we ca...
متن کامل