# Dense graph

In mathematics, a **dense graph** is a graph in which the number of edges is close to the maximal number of edges. The opposite, a graph with only a few edges, is a **sparse graph**. The distinction between sparse and dense graphs is rather vague, and depends on the context.

For undirected simple graphs, the **graph density** is defined as:

For directed simple graphs, the **graph density** is defined as:

where E is the number of edges and V is the number of vertices in the graph. The maximum number of edges is ½ |*V*| (|*V*|−1), so the maximal density is 1 (for complete graphs) and the minimal density is 0 Template:Harv.

## Contents

## Upper density

*Upper density* is an extension of the concept of graph density defined above from finite graphs to infinite graphs. Intuitively, an infinite graph has arbitrarily large finite subgraphs with any density less than its upper density, and does not have arbitrarily large finite subgraphs with density greater than its upper density. Formally, the upper density of a graph *G* is the infimum of the values α such that the finite subgraphs of *G* with density α have a bounded number of vertices. It can be shown using the Erdős–Stone theorem that the upper density can only be 1 or one of the superparticular ratios 0, 1/2, 2/3, 3/4, 4/5, ... *n*/(*n* + 1), ... (see, e.g., Diestel, p. 189).

## Sparse and tight graphs

Template:Harvtxt and Template:Harvtxt define a graph as being (*k*,*l*)-sparse if every nonempty subgraph with *n* vertices has at most *kn* − *l* edges, and (*k*,*l*)-tight if it is (*k*,*l*)-sparse and has exactly *kn* − *l* edges. Thus trees are exactly the (1,1)-tight graphs, forests are exactly the (1,1)-sparse graphs, and graphs with arboricity *k* are exactly the (*k*,*k*)-sparse graphs. Pseudoforests are exactly the (1,0)-sparse graphs, and the Laman graphs arising in rigidity theory are exactly the (2,3)-tight graphs.

Other graph families not characterized by their sparsity can also be described in this way. For instance the facts that any planar graph with *n* vertices has at most 3*n* - 6 edges, and that any subgraph of a planar graph is planar, together imply that the planar graphs are (3,6)-sparse. However, not every (3,6)-sparse graph is planar. Similarly, outerplanar graphs are (2,3)-sparse and planar bipartite graphs are (2,4)-sparse.

Streinu and Theran show that testing (*k*,*l*)-sparsity may be performed in polynomial time when *k* and *l* are integers and 0 ≤ *l* < 2*k*.

## Sparse and dense classes of graphs

Template:Harvtxt considered that the sparsity/density dichotomy makes it necessary to consider infinite graph classes instead of single graph instances. They defined *somewhere dense* graph classes as those classes of graphs for which there exists a threshold *t* such that every complete graph appears as a *t*-subdivision in a subgraph of a graph in the class. To the contrary, if such a threshold does not exist, the class is *nowhere dense*. Properties of the nowhere dense vs somewhere dense dichotomy are discussed in Template:Harvtxt.

## See also

## References

- Paul E. Black, Sparse graph, from
*Dictionary of Algorithms and Data Structures,*Paul E. Black (ed.), NIST. Retrieved on 29 September 2005. - {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=conference }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.