CliqueNumber on LabeledGraph

The most vertices that are pairwise adjacent.

On LabeledGraph

FindStat's St000097. A set of s vertices is a clique when it holds s(s - 1) / 2 edges. The graph with no vertices gives 0.

Called as CombinatorialStat(x, "CliqueNumber"). The head's page has its examples.

Live

Distribution

Over LabeledGraphs at each size, tallied here in your browser; sizes past 6 are not offered.

Sizes 1 to

FindStat St000097

The order of the largest clique of the graph.

The order of the largest clique of the graph. A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.

Object	Value
([],0)	0
([],1)	1
([],2)	1
([],3)	1
([],4)	1
([],5)	1
([],6)	1
([],7)	1

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000097 has the rest.