Identifier
Values
0 => ([(0,1)],2) => ([],2) => 2
1 => ([(0,1)],2) => ([],2) => 2
00 => ([(0,2),(2,1)],3) => ([],3) => 2
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 3
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 3
11 => ([(0,2),(2,1)],3) => ([],3) => 2
000 => ([(0,3),(2,1),(3,2)],4) => ([],4) => 2
111 => ([(0,3),(2,1),(3,2)],4) => ([],4) => 2
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 2
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 2
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
Description
The minimal order of a graph which is not an induced subgraph of the given graph.
For example, the graph with two isolated vertices is not an induced subgraph of the complete graph on three vertices.
By contrast, the minimal number of vertices of a graph which is not a subgraph of a graph is one plus the clique number St000097The order of the largest clique of the graph..
Map
incomparability graph
Description
The incomparability graph of a poset.
Map
poset of factors
Description
The poset of factors of a binary word.
This is the partial order on the set of distinct factors of a binary word, such that $u < v$ if and only if $u$ is a factor of $v$.