Your data matches 50 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000528
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
St000528: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 4 = 5 - 1
Description
The height of a poset. This equals the rank of the poset [[St000080]] plus one.
Matching statistic: St000080
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
St000080: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0 = 2 - 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 3 - 2
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 2 = 4 - 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 2 = 4 - 2
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 3 = 5 - 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 2 = 4 - 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 2 = 4 - 2
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 3 = 5 - 2
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 4 = 6 - 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 3 = 5 - 2
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => 2 = 4 - 2
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 2 = 4 - 2
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 3 - 2
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => 3 = 5 - 2
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 3 = 5 - 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4 = 6 - 2
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 2 = 4 - 2
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => 4 = 6 - 2
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 3 - 2
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => 4 = 6 - 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => 3 = 5 - 2
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 2 = 4 - 2
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 3 = 5 - 2
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 5 = 7 - 2
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 3 = 5 - 2
Description
The rank of the poset.
Matching statistic: St001720
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001720: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 2
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 3
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,3),(2,1),(3,2)],4)
 => 4
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 5
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,5),(2,7),(2,8),(3,6),(3,8),(4,6),(4,7),(5,2),(5,3),(5,4),(6,9),(7,9),(8,9),(9,1)],10)
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => 5
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 6
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => 5
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,6),(2,10),(2,11),(2,12),(3,8),(3,9),(3,12),(4,7),(4,9),(4,11),(5,7),(5,8),(5,10),(6,2),(6,3),(6,4),(6,5),(7,13),(7,16),(8,13),(8,14),(9,13),(9,15),(10,14),(10,16),(11,15),(11,16),(12,14),(12,15),(13,17),(14,17),(15,17),(16,17),(17,1)],18)
 => 4
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,5),(2,7),(2,8),(3,6),(3,8),(4,6),(4,7),(5,2),(5,3),(5,4),(6,9),(7,9),(8,9),(9,1)],10)
 => 4
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 3
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,5),(2,8),(2,9),(3,7),(3,9),(4,7),(4,8),(5,6),(6,2),(6,3),(6,4),(7,10),(8,10),(9,10),(10,1)],11)
 => 5
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => 5
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,5),(2,7),(3,7),(4,1),(5,6),(6,2),(6,3),(7,4)],8)
 => 6
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,5),(1,7),(2,7),(4,6),(5,4),(6,1),(6,2),(7,3)],8)
 => 6
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,2),(2,1)],3)
 => 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,6),(2,7),(3,7),(4,1),(5,4),(6,2),(6,3),(7,5)],8)
 => 6
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,6),(2,8),(2,9),(3,7),(3,9),(4,7),(4,8),(5,1),(6,2),(6,3),(6,4),(7,10),(8,10),(9,10),(10,5)],11)
 => 5
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,6),(1,7),(2,9),(4,8),(5,1),(5,9),(6,2),(6,5),(7,8),(8,3),(9,4),(9,7)],10)
 => 5
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
 => 7
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => 5
Description
The minimal length of a chain of small intervals in a lattice. An interval $[a, b]$ is small if $b$ is a join of elements covering $a$.
Matching statistic: St000093
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
Description
The cardinality of a maximal independent set of vertices of a graph. An independent set of a graph is a set of pairwise non-adjacent vertices. A maximum independent set is an independent set of maximum cardinality. This statistic is also called the independence number or stability number $\alpha(G)$ of $G$.
Matching statistic: St000147
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => [1]
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => [3]
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,1,1]
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => [5]
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [4,1]
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => [3,1,1,1]
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,1,1]
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => [4,1,1]
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [4,1]
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => [5,1]
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => [5,1]
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => [5,1]
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [4,1,1]
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => [4,2]
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => [6]
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [4,1]
 => 4 = 5 - 1
Description
The largest part of an integer partition.
Matching statistic: St000273
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
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.
Matching statistic: St000786
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000786: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
Description
The maximal number of occurrences of a colour in a proper colouring of a graph. To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the largest part occurring in any of these partitions. For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$. Therefore, the statistic on this graph is $3$.
Matching statistic: St000916
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000916: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
Description
The packing number of a graph. This is the size of a largest subset of vertices of a graph, such that any two distinct vertices in the subset have disjoint closed neighbourhoods, or, equivalently, have distance greater than two.
Matching statistic: St001322
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001322: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
Description
The size of a minimal independent dominating set in a graph.
Matching statistic: St001337
Mapping
Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001337: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 2 - 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 4 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 6 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 3 = 4 - 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(4,5)],6)
 => 5 = 6 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(3,4),(3,5),(4,5)],6)
 => 4 = 5 - 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 4 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 4 = 5 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([],6)
 => 6 = 7 - 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(3,4)],5)
 => 4 = 5 - 1
Description
The upper domination number of a graph. This is the maximum cardinality of a minimal dominating set of $G$. The smallest graph with different upper irredundance number and upper domination number has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [1].
The following 40 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001829The common independence number of a graph. St000259The diameter of a connected graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001340The cardinality of a minimal non-edge isolating set of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000643The size of the largest orbit of antichains under Panyushev complementation. St000906The length of the shortest maximal chain in a poset. St000668The least common multiple of the parts of the partition. St001820The size of the image of the pop stack sorting operator. St001668The number of points of the poset minus the width of the poset. St001626The number of maximal proper sublattices of a lattice. St001623The number of doubly irreducible elements of a lattice. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000260The radius of a connected graph. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001877Number of indecomposable injective modules with projective dimension 2. St000455The second largest eigenvalue of a graph if it is integral. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001644The dimension of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000264The girth of a graph, which is not a tree. St001570The minimal number of edges to add to make a graph Hamiltonian. St001645The pebbling number of a connected graph. St000907The number of maximal antichains of minimal length in a poset. St000454The largest eigenvalue of a graph if it is integral. St001651The Frankl number of a lattice. St001875The number of simple modules with projective dimension at most 1. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001118The acyclic chromatic index of a graph. St001330The hat guessing number of a graph. St001621The number of atoms of a lattice. St000327The number of cover relations in a poset. St001637The number of (upper) dissectors of a poset.