1 Introduction
The Bell numbers count the number of different ways to partition a set that has exactly elements. Starting with , the first few Bell numbers are 1, 1, 2, 5, 15, 52, 203 (sequence A141390). The integer can be defined as the sum
where is the Stirling number of the second kind, with parameters and (i.e., the number of partitions of a set of elements into blocks). Dobiński’s formula [4] gives
The 2Bell numbers count the total number of blocks in all partitions of a set of elements. Starting with and , the first few 2Bell numbers are 1, 3, 10, 37, 151, 674 (sequence A005493). More formally, the integer is defined as
Odlyzko and Richmond [12] have studied the average number of blocks in a partition of a set of elements, which can be defined as
A concept very close to the Bell numbers is also defined in graph theory. More precisely, a coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. The chromatic number is the minimum number of colors in a coloring of . Two colorings are equivalent if they induce the same partition of the vertex set into color classes. For an integer , we define as the number of proper nonequivalent colorings of a graph that use exactly colors. Since for or , the total number of nonequivalent colorings of a graph is defined as
In other words, is the number of partitions of the vertex set of whose blocks are stable sets (i.e., sets of pairwise nonadjacent vertices). This invariant has been studied by several authors in the last few years [1, 6, 7, 9, 10, 11] under the name of (graphical) Bell number of .
Let be the total number of stable sets in the set of nonequivalent colorings of a graph . More precisely, we define
We are interested in computing the average number of colors in the nonequivalent colorings of , that is
Clearly, where is the empty graph with vertices. As another example, consider the cycle on 5 vertices. As shown in Figure 1, there are five colorings of with 3 colors, five with 4 colors, and one with 5 colors, which gives , and
This close link between Bell numbers and graph colorings indicates that it is possible to use graph theory to derive inequalities for the Bell numbers. This is the aim of this article. The next section gives values of for some families of graphs and basic properties involving . We give in Section 3 several examples of inequalities for the Bell numbers that can be deduced from relations involving .
Let and be two vertices in a graph . We denote by the graph obtained by identifying (merging) the vertices and and, if and are adjacent vertices, by removing the edge that links and . If parallel edges are created, we keep only one. Also, if is adjacent to , we denote by the graph obtained from by removing the edge that links with , while if is not adjacent to , we denote by the graph obtained by linking with . In what follows, we let , and be the complete graph of order , the path of order , and the cycle of order , respectively. We denote the disjoint union of two graphs and by . We refer to Diestel [3] for basic notions of graph theory that are not defined here.
2 Some values and properties of
The deletioncontraction rule (also often called the Fundamental Reduction Theorem [5]) is a well known method to compute [7, 11]. More precisely, let and be any pair of distinct vertices of . We have,
(1)  
(2) 
It follows that
(3)  
(4) 
Let be a vertex in a graph . We denote by the graph obtained from by removing and all its incident edges. A vertex of a graph is dominating if is adjacent to all other vertices of .
Proposition 1.
If has a dominating vertex , then .
Proof.
Clearly, for all , which implies
and  
Hence, ∎
Duncan [7] has proved that if is a tree, then for all . This leads to our second Proposition.
Proposition 2.
Let be a tree of order . Then and .
Proof.
Since , we immediately get
Let us now compute . Since for all trees , we have , where is the star with a center of degree linked to vertices of degree 1. Hence, and . Since is a dominating vertex in , we have
which implies . ∎
Proposition 3.
Let be the graph obtained from a tree of order by adding isolated verices. Then and .
Proof.
Proposition 4.
Let be a cycle of order . Then,
Proof.
Duncan [7] proved that . It is therefore sufficient to prove that .
If , then . If , Equations (3) together with the fact that is a tree give , and the result follows by induction. ∎
Proposition 5.
Let be the graph obtained from a cycle of order by adding isolated verices. Then
Proof.
Proposition 6.
Let be a graph with a vertex of degree 1. Then .
Proof.
Since has degree 1, we have . Assuming that is of order , we have
and  
We therefore have
which implies . ∎
Proposition 7.
Let and be graphs, and let be positive numbers such that



for all .
Then .
Proof.
Since , we have for . Hence,
∎
3 Inequalities for the Bell numbers
In this section, we show how to derive inequalities for the Bell numbers, using properties related to the average number of colors in nonequivalent colorings of . We start by analyzing paths. As already mentioned, is the graph obtained by adding isolated vertices to a path on vertices.
Theorem 8.
for all and .
Proof.
Proposition 3 immediately gives the following Corollary.
Corollary 9.
If and then
Examples 10.
For and , Corollary 9 provides the following inequalities for the Bell numbers:
These inequalities also follow from Proposition 6. Indeed, is obtained from by removing a vertex of degree 1, which implies
Note that Engel [8] has shown that the sequence is logconvex, which implies (with a nonstrict inequality) for . Recently, Alzer [2] has proved that the sequence is strictly logconvex by showing that
for all . Since , this also implies for all .
As a second example, assume and . Corollary 9 gives
For and , we denote the graph obtained by linking one extremity of to one vertex of (see Figure 2). Also, is the graph obtained from by adding isolated vertices. We now compare with to derive new inequalities involving the Bell numbers.
Theorem 11.
for all and .
Comments
There are no comments yet.