- FindStat

Your data matches 180 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000298
(load all 8 compositions to match this statistic)

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
St000298: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => 1
[[]]
 => ([(0,1)],2)
 => 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => 2
[[[]]]
 => ([(0,2),(2,1)],3)
 => 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => 2
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => 2
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => 2
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => 2
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 2
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 2
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => 2
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 2
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 2
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => 2
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => 2
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => 2
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => 2
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => 2
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => 2
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => 2
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => 2
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 2
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => 2
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => 2
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => 2
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 2
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => 2
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => 2
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => 2
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => 2
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => 2
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => 2
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => 2
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => 2
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => 2
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => 2
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => 2
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 2
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => 2
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => 2
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => 2
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => 2
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => 2
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => 2

Description

The order dimension or Dushnik-Miller dimension of a poset. This is the minimal number of linear orderings whose intersection is the given poset.

Matching statistic: St000920
(load all 6 compositions to match this statistic)

Mapping

Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => []
 => [1,0]
 => 1
[[]]
 => [1,0]
 => [1,1,0,0]
 => 1
[[],[]]
 => [1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[[[]]]
 => [1,1,0,0]
 => [1,1,1,0,0,0]
 => 2
[[],[],[]]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => 1
[[],[[]]]
 => [1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => 2
[[[]],[]]
 => [1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => 2
[[[],[]]]
 => [1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => 2
[[[[]]]]
 => [1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => 2
[[],[],[],[]]
 => [1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 1
[[],[],[[]]]
 => [1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
[[],[[]],[]]
 => [1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 2
[[],[[],[]]]
 => [1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => 2
[[],[[[]]]]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => 2
[[[]],[],[]]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => 2
[[[]],[[]]]
 => [1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => 2
[[[],[]],[]]
 => [1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => 2
[[[[]]],[]]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => 2
[[[],[],[]]]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => 2
[[[],[[]]]]
 => [1,1,0,1,1,0,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => 2
[[[[]],[]]]
 => [1,1,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => 2
[[[[],[]]]]
 => [1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => 2
[[[[[]]]]]
 => [1,1,1,1,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 2
[[],[],[],[],[]]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => 1
[[],[],[],[[]]]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => 2
[[],[],[[]],[]]
 => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => 2
[[],[],[[],[]]]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => 2
[[],[],[[[]]]]
 => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,1,1,0,0,0,0]
 => 2
[[],[[]],[],[]]
 => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => 2
[[],[[]],[[]]]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,1,0,0,1,1,0,0,0]
 => 2
[[],[[],[]],[]]
 => [1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => 2
[[],[[[]]],[]]
 => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => 2
[[],[[],[],[]]]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => 2
[[],[[],[[]]]]
 => [1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => 2
[[],[[[]],[]]]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => 2
[[],[[[],[]]]]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => 2
[[],[[[[]]]]]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => 2
[[[]],[],[],[]]
 => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => 2
[[[]],[],[[]]]
 => [1,1,0,0,1,0,1,1,0,0]
 => [1,1,1,0,0,1,0,1,1,0,0,0]
 => 2
[[[]],[[]],[]]
 => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => 2
[[[]],[[],[]]]
 => [1,1,0,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,1,0,1,0,0,0]
 => 2
[[[]],[[[]]]]
 => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,1,1,0,0,0,0]
 => 2
[[[],[]],[],[]]
 => [1,1,0,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => 2
[[[[]]],[],[]]
 => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,1,0,0,0,1,0,1,0,0]
 => 2
[[[],[]],[[]]]
 => [1,1,0,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,1,0,0,0]
 => 2
[[[[]]],[[]]]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,1,0,0,0,1,1,0,0,0]
 => 2
[[[],[],[]],[]]
 => [1,1,0,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => 2
[[[],[[]]],[]]
 => [1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => 2
[[[[]],[]],[]]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,1,1,0,0,1,0,0,1,0,0]
 => 2
[[[[],[]]],[]]
 => [1,1,1,0,1,0,0,0,1,0]
 => [1,1,1,1,0,1,0,0,0,1,0,0]
 => 2

Description

The logarithmic height of a Dyck path. This is the floor of the binary logarithm of the usual height increased by one:

$\lfloor\log_2(1+height(D))\rfloor$

Matching statistic: St001261
(load all 6 compositions to match this statistic)

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001261: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => ([],1)
 => 1
[[]]
 => ([(0,1)],2)
 => ([],2)
 => 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2
[[[]]]
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 2
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 2
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 2
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 2
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => 2
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 2
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 2
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 2
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 2
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(3,4)],5)
 => 2
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 2
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => ([(1,5),(2,5),(3,5),(4,5)],6)
 => 2
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 2
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 2
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 2
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 2

Description

The Castelnuovo-Mumford regularity of a graph.

Matching statistic: St001624
(load all 5 compositions to match this statistic)

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00282: Posets —Dedekind-MacNeille completion⟶ Lattices
St001624: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

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

Description

The breadth of a lattice. The '''breadth''' of a lattice is the least integer

$b$ such that any join

$x_1\vee x_2\vee\cdots\vee x_n$ , with

$n > b$ , can be expressed as a join over a proper subset of

$\{x_1,x_2,\ldots,x_n\}$ .

Matching statistic: St000535
(load all 8 compositions to match this statistic)

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000535: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
[[]]
 => ([(0,1)],2)
 => ([],2)
 => 0 = 1 - 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1 = 2 - 1
[[[]]]
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 1 - 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 1 = 2 - 1
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 1 = 2 - 1
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 1 - 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => 1 = 2 - 1
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(3,4)],5)
 => 1 = 2 - 1
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0 = 1 - 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => ([(1,5),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1

Description

The rank-width of a graph.

Matching statistic: St001333
(load all 6 compositions to match this statistic)

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001333: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
[[]]
 => ([(0,1)],2)
 => ([],2)
 => 0 = 1 - 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1 = 2 - 1
[[[]]]
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 1 - 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 1 = 2 - 1
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 1 = 2 - 1
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 1 - 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => 1 = 2 - 1
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(3,4)],5)
 => 1 = 2 - 1
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0 = 1 - 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => ([(1,5),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1

Description

The cardinality of a minimal edge-isolating set of a graph. Let

$\mathcal F$ be a set of graphs. A set of vertices

$S$ is

$\mathcal F$ -isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of

$S$ does not contain any graph in

$\mathcal F$ . This statistic returns the cardinality of the smallest isolating set when

$\mathcal F$ contains only the graph with one edge.

Matching statistic: St001393
(load all 7 compositions to match this statistic)

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001393: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
[[]]
 => ([(0,1)],2)
 => ([],2)
 => 0 = 1 - 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1 = 2 - 1
[[[]]]
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 0 = 1 - 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 1 = 2 - 1
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 1 = 2 - 1
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 0 = 1 - 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => 1 = 2 - 1
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => 1 = 2 - 1
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(3,4)],5)
 => 1 = 2 - 1
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 0 = 1 - 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => ([(1,5),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => 1 = 2 - 1
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 1 = 2 - 1

Description

The induced matching number of a graph. An induced matching of a graph is a set of independent edges which is an induced subgraph. This statistic records the maximal number of edges in an induced matching.

Matching statistic: St000159

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000159: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => ([],1)
 => [1]
 => 1
[[]]
 => ([(0,1)],2)
 => ([],2)
 => [1,1]
 => 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => [2,1]
 => 2
[[[]]]
 => ([(0,2),(2,1)],3)
 => ([],3)
 => [1,1,1]
 => 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => [3,1]
 => 2
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => [3,1]
 => 2
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => [3,1]
 => 2
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => [2,1,1]
 => 2
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => [1,1,1,1]
 => 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => [4,1]
 => 2
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => [4,1]
 => 2
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => [3,1,1]
 => 2
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => [3,1,1]
 => 2
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => [3,1,1]
 => 2
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(3,4)],5)
 => [2,1,1,1]
 => 2
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => [1,1,1,1,1]
 => 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => ([(1,5),(2,5),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => [5,1]
 => 2
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => [5,1]
 => 2
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => [5,1]
 => 2
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => [5,1]
 => 2
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 2

Description

The number of distinct parts of the integer partition. This statistic is also the number of removeable cells of the partition, and the number of valleys of the Dyck path tracing the shape of the partition.

Matching statistic: St000258
(load all 2 compositions to match this statistic)

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St000258: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
[[]]
 => ([(0,1)],2)
 => ([],2)
 => ([],1)
 => 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 2
[[[]]]
 => ([(0,2),(2,1)],3)
 => ([],3)
 => ([],1)
 => 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 2
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => ([],1)
 => 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 2
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 2
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => ([],1)
 => 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => ([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 2
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 2
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2

Description

The burning number of a graph. This is the minimum number of rounds needed to burn all vertices of a graph. In each round, the neighbours of all burned vertices are burnt. Additionally, an unburned vertex may be chosen to be burned.

Matching statistic: St000273

Mapping

Mp00047: Ordered trees —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[]
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
[[]]
 => ([(0,1)],2)
 => ([],2)
 => ([],1)
 => 1
[[],[]]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(1,2)],3)
 => 2
[[[]]]
 => ([(0,2),(2,1)],3)
 => ([],3)
 => ([],1)
 => 1
[[],[],[]]
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[],[[]]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => 2
[[[]],[]]
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => 2
[[[],[]]]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(1,2)],3)
 => 2
[[[[]]]]
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => ([],1)
 => 1
[[],[],[],[]]
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[],[[]]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[],[[]],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[],[[],[]]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[[]]]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 2
[[[]],[],[]]
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[[]],[[]]]
 => ([(0,3),(1,2),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,2)],3)
 => 2
[[[],[]],[]]
 => ([(0,4),(1,3),(2,3),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[[]]],[]]
 => ([(0,4),(1,2),(2,3),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 2
[[[],[],[]]]
 => ([(0,4),(1,4),(2,4),(4,3)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[[],[[]]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 2
[[[[]],[]]]
 => ([(0,4),(1,2),(2,4),(4,3)],5)
 => ([(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 2
[[[[],[]]]]
 => ([(0,4),(1,4),(2,3),(4,2)],5)
 => ([(3,4)],5)
 => ([(1,2)],3)
 => 2
[[[[[]]]]]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => ([],1)
 => 1
[[],[],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[],[],[[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[],[[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[],[[],[]]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[],[[[]]]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[],[[]],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[]],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[],[[],[]],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[[]]],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[],[[],[],[]]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[],[[],[[]]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[[]],[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[[],[]]]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[],[[[[]]]]]
 => ([(0,5),(1,4),(2,5),(3,2),(4,3)],6)
 => ([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2)],3)
 => 2
[[[]],[],[],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[]],[],[[]]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[[]],[[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[[]],[[],[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[]],[[[]]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(1,2)],3)
 => 2
[[[],[]],[],[]]
 => ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[[]]],[],[]]
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
[[[],[]],[[]]]
 => ([(0,4),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[[]]],[[]]]
 => ([(0,3),(1,4),(2,5),(3,5),(4,2)],6)
 => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(1,2)],3)
 => 2
[[[],[],[]],[]]
 => ([(0,5),(1,5),(2,5),(3,4),(5,4)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
[[[],[[]]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[[]],[]],[]]
 => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
 => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
[[[[],[]]],[]]
 => ([(0,5),(1,4),(2,4),(3,5),(4,3)],6)
 => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2

Description

The domination number of a graph. The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.

The following 170 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St000287The number of connected components of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000346The number of coarsenings of a partition. St000396The register function (or Horton-Strahler number) of a binary tree. St000397The Strahler number of a rooted tree. St000451The length of the longest pattern of the form k 1 2. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000544The cop number of a graph. St000679The pruning number of an ordered tree. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000701The protection number of a binary tree. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000783The side length of the largest staircase partition fitting into a partition. St000862The number of parts of the shifted shape of a permutation. St000916The packing number of a graph. St000918The 2-limited packing number of a graph. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000955Number of times one has

$Ext^i(D(A),A)>0$ for

$i>0$ for the corresponding LNakayama algebra. St000991The number of right-to-left minima of a permutation. St001093The detour number of a graph. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001363The Euler characteristic of a graph according to Knill. St001432The order dimension of the partition. St001463The number of distinct columns in the nullspace of a graph. St001471The magnitude of a Dyck path. St001530The depth of a Dyck path. St001674The number of vertices of the largest induced star graph in the graph. St001732The number of peaks visible from the left. St001734The lettericity of a graph. St001741The largest integer such that all patterns of this size are contained in the permutation. St001829The common independence number of a graph. St000028The number of stack-sorts needed to sort a permutation. St000183The side length of the Durfee square of an integer partition. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000662The staircase size of the code of a permutation. St000671The maximin edge-connectivity for choosing a subgraph. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000742The number of big ascents of a permutation after prepending zero. St000897The number of different multiplicities of parts of an integer partition. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001090The number of pop-stack-sorts needed to sort a permutation. St001092The number of distinct even parts of a partition. St001192The maximal dimension of

$Ext_A^2(S,A)$ for a simple module

$S$ over the corresponding Nakayama algebra

$A$ . St001271The competition number of a graph. St001280The number of parts of an integer partition that are at least two. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001335The cardinality of a minimal cycle-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001512The minimum rank of a graph. St001665The number of pure excedances of a permutation. St001673The degree of asymmetry of an integer composition. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St000058The order of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000527The width of the poset. St000542The number of left-to-right-minima of a permutation. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001029The size of the core of a graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000141The maximum drop size of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000374The number of exclusive right-to-left minima of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000651The maximal size of a rise in a permutation. St000659The number of rises of length at least 2 of a Dyck path. St000845The maximal number of elements covered by an element in a poset. St000864The number of circled entries of the shifted recording tableau of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001174The Gorenstein dimension of the algebra

$A/I$ when

$I$ is the tilting module corresponding to the permutation in the Auslander algebra of

$K[x]/(x^n)$ . St001194The injective dimension of

$A/AfA$ in the corresponding Nakayama algebra

$A$ when

$Af$ is the minimal faithful projective-injective left

$A$ -module St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001587Half of the largest even part of an integer partition. St001737The number of descents of type 2 in a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000253The crossing number of a set partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000444The length of the maximal rise of a Dyck path. St000485The length of the longest cycle of a permutation. St000668The least common multiple of the parts of the partition. St000254The nesting number of a set partition. St000392The length of the longest run of ones in a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000640The rank of the largest boolean interval in a poset. St000730The maximal arc length of a set partition. St000919The number of maximal left branches of a binary tree. St001195The global dimension of the algebra

$A/AfA$ of the corresponding Nakayama algebra

$A$ with minimal left faithful projective-injective module

$Af$ . St001198The number of simple modules in the algebra

$eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001206The maximal dimension of an indecomposable projective

$eAe$ -module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module

$eA$ . St001570The minimal number of edges to add to make a graph Hamiltonian. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001060The distinguishing index of a graph. St001200The number of simple modules in

$eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001205The number of non-simple indecomposable projective-injective modules of the algebra

$eAe$ in the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001118The acyclic chromatic index of a graph. St001545The second Elser number of a connected graph. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001621The number of atoms of a lattice. St001632The number of indecomposable injective modules

$I$ with

$dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000891The number of distinct diagonal sums of a permutation matrix. St000243The number of cyclic valleys and cyclic peaks of a permutation. St001569The maximal modular displacement of a permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000100The number of linear extensions of a poset. St000307The number of rowmotion orbits of a poset. St000454The largest eigenvalue of a graph if it is integral. St000574The number of occurrences of the pattern {{1},{2}} such that 1 is a minimal and 2 a maximal element. St000619The number of cyclic descents of a permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000846The maximal number of elements covering an element of a poset. St001735The number of permutations with the same set of runs. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000563The number of overlapping pairs of blocks of a set partition. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000632The jump number of the poset. St000732The number of double deficiencies of a permutation. St001839The number of excedances of a set partition. St000633The size of the automorphism group of a poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001268The size of the largest ordinal summand in the poset. St001399The distinguishing number of a poset. St001779The order of promotion on the set of linear extensions of a poset. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St001397Number of pairs of incomparable elements in a finite poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001645The pebbling number of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St001330The hat guessing number of a graph. St001964The interval resolution global dimension of a poset.