Your data matches 105 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001397: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 0
([],2)
=> 1
([(0,1)],2)
=> 0
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> 1
([(0,2),(2,1)],3)
=> 0
([(0,2),(1,2)],3)
=> 1
([],4)
=> 6
([(2,3)],4)
=> 5
([(1,2),(1,3)],4)
=> 4
([(0,1),(0,2),(0,3)],4)
=> 3
([(0,2),(0,3),(3,1)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
([(1,2),(2,3)],4)
=> 3
([(0,3),(3,1),(3,2)],4)
=> 1
([(1,3),(2,3)],4)
=> 4
([(0,3),(1,3),(3,2)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 4
([(0,3),(1,2),(1,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> 0
([(0,3),(1,2),(2,3)],4)
=> 2
([],5)
=> 10
([(3,4)],5)
=> 9
([(2,3),(2,4)],5)
=> 8
([(1,2),(1,3),(1,4)],5)
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(2,3),(3,4)],5)
=> 7
([(1,4),(4,2),(4,3)],5)
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> 3
([(2,4),(3,4)],5)
=> 8
([(1,4),(2,4),(4,3)],5)
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> 2
([(1,4),(2,4),(3,4)],5)
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> 6
([(0,4),(1,4),(2,3)],5)
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> 6
Description
Number of pairs of incomparable elements in a finite poset. For a finite poset $(P,\leq)$, this is the number of unordered pairs $\{x,y\} \in \binom{P}{2}$ with $x \not\leq y$ and $y \not\leq x$.
Mp00198: Posets incomparability graphGraphs
St000081: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 6
Description
The number of edges of a graph.
Mp00198: Posets incomparability graphGraphs
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
St000228: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> []
=> 0
([],2)
=> ([(0,1)],2)
=> [1]
=> 1
([(0,1)],2)
=> ([],2)
=> []
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [1]
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> []
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [1]
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [2]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [3]
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [1,1]
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> []
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [2]
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [1]
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [3]
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [1,1]
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [1,1]
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
Description
The size of a partition. This statistic is the constant statistic of the level sets.
Mp00198: Posets incomparability graphGraphs
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
St000459: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> []
=> 0
([],2)
=> ([(0,1)],2)
=> [1]
=> 1
([(0,1)],2)
=> ([],2)
=> []
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [1]
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> []
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [1]
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [2]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [3]
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [1,1]
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> []
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [2]
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [1]
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [3]
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [1,1]
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [1,1]
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
Description
The hook length of the base cell of a partition. This is also known as the perimeter of a partition. In particular, the perimeter of the empty partition is zero.
Mp00198: Posets incomparability graphGraphs
Mp00203: Graphs coneGraphs
St001311: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([(0,1)],2)
=> 0
([],2)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1)],2)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
Description
The cyclomatic number of a graph. This is the minimum number of edges that must be removed from the graph so that the result is a forest. This is also the first Betti number of the graph. It can be computed as $c + m - n$, where $c$ is the number of connected components, $m$ is the number of edges and $n$ is the number of vertices.
Mp00198: Posets incomparability graphGraphs
Mp00259: Graphs vertex additionGraphs
St001341: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],2)
=> 0
([],2)
=> ([(0,1)],2)
=> ([(1,2)],3)
=> 1
([(0,1)],2)
=> ([],2)
=> ([],3)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(1,2),(1,3),(2,3)],4)
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,3),(2,3)],4)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(2,3)],4)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([],4)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(2,3)],4)
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(3,4)],5)
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,4),(2,4),(3,4)],5)
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(3,4)],5)
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(3,4)],5)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,4),(2,3),(3,4)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(1,4),(2,3)],5)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([],5)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(2,4),(3,4)],5)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(3,4),(3,5),(4,5)],6)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(4,5)],6)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(2,5),(3,4),(4,5)],6)
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(2,5),(3,4)],6)
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(3,4),(3,5),(4,5)],6)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(2,5),(3,4)],6)
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(3,4),(3,5),(4,5)],6)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> 6
Description
The number of edges in the center of a graph. The center of a graph is the set of vertices whose maximal distance to any other vertex is minimal. In particular, if the graph is disconnected, all vertices are in the certer.
Mp00198: Posets incomparability graphGraphs
Mp00203: Graphs coneGraphs
St000450: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([(0,1)],2)
=> 1 = 0 + 1
([],2)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,1)],2)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7 = 6 + 1
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6 = 5 + 1
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5 = 4 + 1
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5 = 4 + 1
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 5 = 4 + 1
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 11 = 10 + 1
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 10 = 9 + 1
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 9 = 8 + 1
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8 = 7 + 1
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7 = 6 + 1
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6 = 5 + 1
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7 = 6 + 1
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6 = 5 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8 = 7 + 1
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6 = 5 + 1
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 9 = 8 + 1
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6 = 5 + 1
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8 = 7 + 1
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7 = 6 + 1
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 8 = 7 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7 = 6 + 1
Description
The number of edges minus the number of vertices plus 2 of a graph. When G is connected and planar, this is also the number of its faces. When $G=(V,E)$ is a connected graph, this is its $k$-monochromatic index for $k>2$: for $2\leq k\leq |V|$, the $k$-monochromatic index of $G$ is the maximum number of edge colors allowed such that for each set $S$ of $k$ vertices, there exists a monochromatic tree in $G$ which contains all vertices from $S$. It is shown in [1] that for $k>2$, this is given by this statistic.
Matching statistic: St000448
Mp00198: Posets incomparability graphGraphs
Mp00111: Graphs complementGraphs
Mp00203: Graphs coneGraphs
St000448: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> ([(0,1)],2)
=> 0
([],2)
=> ([(0,1)],2)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 1
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 6
Description
The number of pairs of vertices of a graph with distance 2. This is the coefficient of the quadratic term of the Wiener polynomial.
Mp00198: Posets incomparability graphGraphs
Mp00111: Graphs complementGraphs
Mp00203: Graphs coneGraphs
St001646: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([],1)
=> ([],1)
=> ([(0,1)],2)
=> 0
([],2)
=> ([(0,1)],2)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 1
([(0,1)],2)
=> ([],2)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 6
Description
The number of edges that can be added without increasing the maximal degree of a graph. This statistic is (except for the degenerate case of two vertices) maximized by the star-graph on $n$ vertices, which has maximal degree $n-1$ and therefore has statistic $\binom{n-1}{2}$.
Mp00198: Posets incomparability graphGraphs
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
St000460: Integer partitions ⟶ ℤResult quality: 91% values known / values provided: 94%distinct values known / distinct values provided: 91%
Values
([],1)
=> ([],1)
=> []
=> ? = 0
([],2)
=> ([(0,1)],2)
=> [1]
=> 1
([(0,1)],2)
=> ([],2)
=> []
=> ? = 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2]
=> 2
([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> [1]
=> 1
([(0,2),(2,1)],3)
=> ([],3)
=> []
=> ? = 0
([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> [1]
=> 1
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 6
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 5
([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> [2]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(1,2),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 4
([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 3
([(0,3),(1,2)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 4
([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [3]
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> [1,1]
=> 2
([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> []
=> ? = 0
([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [2]
=> 2
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> 10
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 9
([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 8
([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(1,3),(1,4),(4,2)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> 4
([(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> [1]
=> 1
([(0,3),(0,4),(3,2),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [3]
=> 3
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> [1,1]
=> 2
([(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(1,4),(4,2),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 8
([(1,4),(2,4),(4,3)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> [1,1]
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 7
([(0,4),(1,4),(2,4),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3]
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,4),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 7
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> 6
([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> 5
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> 4
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(3,4)],5)
=> [1]
=> 1
([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> 4
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> []
=> ? = 0
Description
The hook length of the last cell along the main diagonal of an integer partition.
The following 95 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000870The product of the hook lengths of the diagonal cells in an integer partition. St001746The coalition number of a graph. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000144The pyramid weight of the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001645The pebbling number of a connected graph. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St001622The number of join-irreducible elements of a lattice. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000456The monochromatic index of a connected graph. St001621The number of atoms of a lattice. St000454The largest eigenvalue of a graph if it is integral. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St000642The size of the smallest orbit of antichains under Panyushev complementation. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001330The hat guessing number of a graph. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000552The number of cut vertices of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001305The number of induced cycles on four vertices in a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001479The number of bridges of a graph. St001512The minimum rank of a graph. St001689The number of celebrities in a graph. St001736The total number of cycles in a graph. St000363The number of minimal vertex covers of a graph. St000553The number of blocks of a graph. St001271The competition number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St001725The harmonious chromatic number of a graph. St000469The distinguishing number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001691The number of kings in a graph. St001883The mutual visibility number of a graph. St001877Number of indecomposable injective modules with projective dimension 2. St001875The number of simple modules with projective dimension at most 1. 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$. St000455The second largest eigenvalue of a graph if it is integral. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in 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. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000907The number of maximal antichains of minimal length in a poset. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001060The distinguishing index of a graph. St001568The smallest positive integer that does not appear twice in the partition. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001117The game chromatic index of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001649The length of a longest trail in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001812The biclique partition number of a graph. St001869The maximum cut size of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000315The number of isolated vertices of a graph. St000264The girth of a graph, which is not a tree. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. 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. St001624The breadth of a lattice.