The Setting
Independence bounds under clique exclusion compare the size of an independent set with the average degree of a finite simple graph. Write and for the vertex set and the set of unordered edges of a graph , respectively.
The Definition
Definition 1. Let be a finite simple graph. The average degree of is the real number given by (1) when is nonempty, and is when is empty. (1)✦
In the paper, an independent set of a finite simple graph is a set of pairwise nonadjacent vertices of and the independence number of is the maximum size of such a set; for , ; and, for a natural number , is -free if it contains no pairwise adjacent vertices, with ordinary subgraph exclusion.
What Is Checked
The average degree is defined for finite simple graphs.