Skip to content

FourCliqueCount on LabeledGraph ​

The sets of four vertices that are pairwise adjacent.

On LabeledGraph

FindStat's St001309. The graph with no vertices gives 0.

Called as CombinatorialStat(x, "FourCliqueCount"). 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.

FindStat St001309

The number of four-cliques in a graph.

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

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