Your data matches 24 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001767
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001767: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => [4,3,2,1]
 => 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 2
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 2
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => [5,3,3,1]
 => 2
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => [5,4,3,2,1]
 => 2
Description
The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. Assign to each cell of the Ferrers diagram an arrow pointing north, east, south or west. Then compute for each cell the number of arrows pointing towards it, and take the minimum of those. This statistic is the maximal minimum that can be obtained by assigning arrows in any way.
Matching statistic: St000257
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000257: Integer partitions ⟶ ℤResult quality: 50% ●values known / values provided: 50%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => [2]
 => [1,1]
 => 1 = 0 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [3,2]
 => [2,2,1]
 => 1 = 0 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [4,2]
 => [2,2,1,1]
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [6,2]
 => [2,2,1,1,1,1]
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [8,4,2]
 => [3,3,2,2,1,1,1,1]
 => ? = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [6,6,6,2]
 => [4,4,3,3,3,3]
 => 2 = 1 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [6,6,6,2]
 => [4,4,3,3,3,3]
 => 2 = 1 + 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => [10,10,10,5,5,2]
 => [6,6,5,5,5,3,3,3,3,3]
 => ? = 1 + 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [8,8,8,8,8,8,8,8,4,2]
 => [10,10,9,9,8,8,8,8]
 => ? = 2 + 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [8,8,8,8,8,8,8,8,4,2]
 => [10,10,9,9,8,8,8,8]
 => ? = 2 + 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => [6,6,6,6,6,6,6,3,3,2]
 => [10,10,9,7,7,7]
 => ? = 2 + 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => [12,12,12,12,12,12,12,12,12,6,6,6,4,2]
 => [14,14,13,13,12,12,9,9,9,9,9,9]
 => ? = 2 + 1
Description
The number of distinct parts of a partition that occur at least twice. See Section 3.3.1 of [2].
Matching statistic: St001638
(load all 3 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St001638: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ? = 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ? = 2
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ? = 2
Description
The book thickness of a graph. The book thickness (or pagenumber, or stacknumber) of a graph is the minimal number of pages required for a book embedding of a graph.
Matching statistic: St000482
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000482: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 2 = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1 + 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ? = 1 + 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2 + 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2 + 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ? = 2 + 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ? = 2 + 1
Description
The (zero)-forcing number of a graph. This is the minimal number of vertices initially coloured black, such that eventually all vertices of the graph are coloured black when using the following rule: when $u$ is a black vertex of $G$, and exactly one neighbour $v$ of $u$ is white, then colour $v$ black.
Matching statistic: St000776
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000776: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 2 = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1 + 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ? = 1 + 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2 + 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2 + 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ? = 2 + 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ? = 2 + 1
Description
The maximal multiplicity of an eigenvalue in a graph.
Matching statistic: St000986
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000986: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => 2 = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1 + 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ? = 1 + 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2 + 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2 + 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ? = 2 + 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ? = 2 + 1
Description
The multiplicity of the eigenvalue zero of the adjacency matrix of the graph.
Matching statistic: St001335
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St001335: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? = 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? = 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ([(0,3),(0,4),(0,7),(0,8),(0,9),(1,2),(1,4),(1,5),(1,6),(1,8),(1,9),(2,3),(2,5),(2,6),(2,8),(2,9),(3,4),(3,5),(3,7),(3,8),(4,6),(4,7),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9),(7,8),(7,9),(8,9)],10)
 => ? = 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ([(0,4),(0,5),(0,6),(0,7),(0,9),(0,10),(0,11),(0,12),(0,13),(0,14),(0,15),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(1,11),(1,12),(1,14),(1,15),(2,3),(2,5),(2,6),(2,7),(2,8),(2,10),(2,12),(2,13),(2,14),(2,15),(3,4),(3,6),(3,7),(3,8),(3,9),(3,11),(3,13),(3,14),(3,15),(4,5),(4,6),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(4,15),(5,7),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(5,15),(6,7),(6,8),(6,9),(6,10),(6,11),(6,13),(6,14),(7,8),(7,9),(7,10),(7,12),(7,13),(7,15),(8,9),(8,10),(8,11),(8,12),(8,13),(8,14),(8,15),(9,10),(9,11),(9,12),(9,13),(9,14),(9,15),(10,11),(10,12),(10,13),(10,14),(10,15),(11,12),(11,13),(11,14),(11,15),(12,13),(12,14),(12,15),(13,14),(13,15),(14,15)],16)
 => ? = 2
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ([(0,4),(0,5),(0,6),(0,7),(0,9),(0,10),(0,11),(0,12),(0,13),(0,14),(0,15),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(1,11),(1,12),(1,14),(1,15),(2,3),(2,5),(2,6),(2,7),(2,8),(2,10),(2,12),(2,13),(2,14),(2,15),(3,4),(3,6),(3,7),(3,8),(3,9),(3,11),(3,13),(3,14),(3,15),(4,5),(4,6),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(4,15),(5,7),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(5,15),(6,7),(6,8),(6,9),(6,10),(6,11),(6,13),(6,14),(7,8),(7,9),(7,10),(7,12),(7,13),(7,15),(8,9),(8,10),(8,11),(8,12),(8,13),(8,14),(8,15),(9,10),(9,11),(9,12),(9,13),(9,14),(9,15),(10,11),(10,12),(10,13),(10,14),(10,15),(11,12),(11,13),(11,14),(11,15),(12,13),(12,14),(12,15),(13,14),(13,15),(14,15)],16)
 => ? = 2
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ([(0,1),(0,2),(0,3),(0,7),(0,9),(0,10),(0,11),(1,2),(1,3),(1,6),(1,8),(1,10),(1,11),(2,3),(2,5),(2,8),(2,9),(2,11),(3,4),(3,8),(3,9),(3,10),(4,5),(4,6),(4,7),(4,8),(4,9),(4,10),(4,11),(5,6),(5,7),(5,8),(5,9),(5,10),(5,11),(6,7),(6,8),(6,9),(6,10),(6,11),(7,8),(7,9),(7,10),(7,11),(8,9),(8,10),(8,11),(9,10),(9,11),(10,11)],12)
 => ? = 2
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ([(0,3),(0,4),(0,5),(0,6),(0,9),(0,10),(0,11),(0,12),(0,13),(0,14),(1,2),(1,4),(1,5),(1,6),(1,7),(1,8),(1,11),(1,12),(1,13),(1,14),(2,3),(2,5),(2,6),(2,7),(2,8),(2,10),(2,12),(2,13),(2,14),(3,4),(3,5),(3,7),(3,9),(3,10),(3,11),(3,12),(3,13),(3,14),(4,6),(4,8),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,7),(5,8),(5,9),(5,10),(5,12),(5,13),(6,7),(6,8),(6,9),(6,11),(6,12),(6,14),(7,8),(7,9),(7,10),(7,11),(7,13),(7,14),(8,9),(8,10),(8,11),(8,13),(8,14),(9,10),(9,11),(9,12),(9,13),(9,14),(10,11),(10,12),(10,13),(10,14),(11,12),(11,13),(11,14),(12,13),(12,14),(13,14)],15)
 => ? = 2
Description
The cardinality of a minimal cycle-isolating set of a graph. Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$. This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains all cycles.
Matching statistic: St001578
(load all 3 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00117: Graphs —Ore closure⟶ Graphs
St001578: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ? = 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ? = 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ? = 2
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ? = 2
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ? = 2
Description
The minimal number of edges to add or remove to make a graph a line graph.
Matching statistic: St000309
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000309: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => ([(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)
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
 => 2 = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => ([(0,3),(0,6),(0,7),(0,8),(1,2),(1,4),(1,6),(1,7),(1,8),(2,4),(2,5),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? = 1 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => ([(0,3),(0,6),(0,7),(0,8),(1,2),(1,4),(1,6),(1,7),(1,8),(2,4),(2,5),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? = 1 + 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(1,2),(1,7),(1,9),(2,6),(2,8),(3,4),(3,6),(3,8),(3,9),(4,7),(4,8),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,9),(7,8),(8,9)],10)
 => ([(0,3),(0,8),(0,9),(1,2),(1,7),(1,9),(2,5),(2,7),(2,9),(3,6),(3,8),(3,9),(4,5),(4,6),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9),(7,9),(8,9)],10)
 => ? = 1 + 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
 => ([(0,1),(0,4),(0,12),(0,13),(0,14),(0,15),(1,4),(1,8),(1,12),(1,13),(1,14),(1,15),(2,3),(2,6),(2,7),(2,10),(2,11),(2,13),(2,14),(2,15),(3,6),(3,7),(3,9),(3,11),(3,12),(3,13),(3,14),(3,15),(4,5),(4,8),(4,10),(4,12),(4,13),(4,14),(4,15),(5,6),(5,8),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(5,15),(6,7),(6,8),(6,9),(6,10),(6,11),(6,14),(6,15),(7,9),(7,10),(7,11),(7,12),(7,13),(7,14),(7,15),(8,9),(8,11),(8,12),(8,13),(8,14),(8,15),(9,10),(9,11),(9,12),(9,13),(9,14),(9,15),(10,11),(10,12),(10,13),(10,14),(10,15),(11,13),(11,14),(11,15),(12,13),(12,14),(12,15),(13,14),(13,15),(14,15)],16)
 => ? = 2 + 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
 => ([(0,1),(0,4),(0,12),(0,13),(0,14),(0,15),(1,4),(1,8),(1,12),(1,13),(1,14),(1,15),(2,3),(2,6),(2,7),(2,10),(2,11),(2,13),(2,14),(2,15),(3,6),(3,7),(3,9),(3,11),(3,12),(3,13),(3,14),(3,15),(4,5),(4,8),(4,10),(4,12),(4,13),(4,14),(4,15),(5,6),(5,8),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(5,15),(6,7),(6,8),(6,9),(6,10),(6,11),(6,14),(6,15),(7,9),(7,10),(7,11),(7,12),(7,13),(7,14),(7,15),(8,9),(8,11),(8,12),(8,13),(8,14),(8,15),(9,10),(9,11),(9,12),(9,13),(9,14),(9,15),(10,11),(10,12),(10,13),(10,14),(10,15),(11,13),(11,14),(11,15),(12,13),(12,14),(12,15),(13,14),(13,15),(14,15)],16)
 => ? = 2 + 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(2,9),(2,10),(2,11),(3,4),(3,5),(3,8),(3,11),(4,5),(4,7),(4,10),(5,6),(5,9),(6,7),(6,8),(6,10),(6,11),(7,8),(7,9),(7,11),(8,9),(8,10),(9,10),(9,11),(10,11)],12)
 => ([(0,5),(0,7),(0,8),(0,10),(0,11),(1,4),(1,6),(1,8),(1,10),(1,11),(2,3),(2,6),(2,7),(2,10),(2,11),(3,6),(3,7),(3,9),(3,10),(3,11),(4,6),(4,8),(4,9),(4,10),(4,11),(5,7),(5,8),(5,9),(5,10),(5,11),(6,9),(6,10),(6,11),(7,9),(7,10),(7,11),(8,9),(8,10),(8,11),(9,10),(9,11),(10,11)],12)
 => ? = 2 + 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(1,2),(1,10),(1,12),(1,14),(2,9),(2,11),(2,13),(3,7),(3,8),(3,11),(3,12),(3,13),(3,14),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,8),(5,9),(5,11),(5,12),(5,13),(5,14),(6,7),(6,10),(6,11),(6,12),(6,13),(6,14),(7,8),(7,9),(7,11),(7,13),(7,14),(8,10),(8,12),(8,13),(8,14),(9,10),(9,12),(9,14),(10,11),(10,13),(11,12),(11,14),(12,13),(13,14)],15)
 => ([(0,3),(0,9),(0,13),(0,14),(1,2),(1,8),(1,12),(1,14),(2,6),(2,8),(2,12),(2,14),(3,7),(3,9),(3,13),(3,14),(4,6),(4,8),(4,10),(4,11),(4,12),(4,13),(4,14),(5,7),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(6,8),(6,10),(6,12),(6,13),(6,14),(7,9),(7,10),(7,12),(7,13),(7,14),(8,11),(8,12),(8,14),(9,11),(9,13),(9,14),(10,11),(10,12),(10,13),(10,14),(11,12),(11,13),(11,14),(12,14),(13,14)],15)
 => ? = 2 + 1
Description
The number of vertices with even degree.
Matching statistic: St001716
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St001716: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 1 = 0 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2 = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? = 1 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
 => ? = 1 + 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => ([(0,3),(0,4),(0,7),(0,8),(0,9),(1,2),(1,4),(1,5),(1,6),(1,8),(1,9),(2,3),(2,5),(2,6),(2,8),(2,9),(3,4),(3,5),(3,7),(3,8),(4,6),(4,7),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9),(7,8),(7,9),(8,9)],10)
 => ? = 1 + 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ([(0,4),(0,5),(0,6),(0,7),(0,9),(0,10),(0,11),(0,12),(0,13),(0,14),(0,15),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(1,11),(1,12),(1,14),(1,15),(2,3),(2,5),(2,6),(2,7),(2,8),(2,10),(2,12),(2,13),(2,14),(2,15),(3,4),(3,6),(3,7),(3,8),(3,9),(3,11),(3,13),(3,14),(3,15),(4,5),(4,6),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(4,15),(5,7),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(5,15),(6,7),(6,8),(6,9),(6,10),(6,11),(6,13),(6,14),(7,8),(7,9),(7,10),(7,12),(7,13),(7,15),(8,9),(8,10),(8,11),(8,12),(8,13),(8,14),(8,15),(9,10),(9,11),(9,12),(9,13),(9,14),(9,15),(10,11),(10,12),(10,13),(10,14),(10,15),(11,12),(11,13),(11,14),(11,15),(12,13),(12,14),(12,15),(13,14),(13,15),(14,15)],16)
 => ? = 2 + 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => ([(0,4),(0,5),(0,6),(0,7),(0,9),(0,10),(0,11),(0,12),(0,13),(0,14),(0,15),(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(1,11),(1,12),(1,14),(1,15),(2,3),(2,5),(2,6),(2,7),(2,8),(2,10),(2,12),(2,13),(2,14),(2,15),(3,4),(3,6),(3,7),(3,8),(3,9),(3,11),(3,13),(3,14),(3,15),(4,5),(4,6),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(4,15),(5,7),(5,9),(5,10),(5,11),(5,12),(5,13),(5,14),(5,15),(6,7),(6,8),(6,9),(6,10),(6,11),(6,13),(6,14),(7,8),(7,9),(7,10),(7,12),(7,13),(7,15),(8,9),(8,10),(8,11),(8,12),(8,13),(8,14),(8,15),(9,10),(9,11),(9,12),(9,13),(9,14),(9,15),(10,11),(10,12),(10,13),(10,14),(10,15),(11,12),(11,13),(11,14),(11,15),(12,13),(12,14),(12,15),(13,14),(13,15),(14,15)],16)
 => ? = 2 + 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => ([(0,1),(0,2),(0,3),(0,7),(0,9),(0,10),(0,11),(1,2),(1,3),(1,6),(1,8),(1,10),(1,11),(2,3),(2,5),(2,8),(2,9),(2,11),(3,4),(3,8),(3,9),(3,10),(4,5),(4,6),(4,7),(4,8),(4,9),(4,10),(4,11),(5,6),(5,7),(5,8),(5,9),(5,10),(5,11),(6,7),(6,8),(6,9),(6,10),(6,11),(7,8),(7,9),(7,10),(7,11),(8,9),(8,10),(8,11),(9,10),(9,11),(10,11)],12)
 => ? = 2 + 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => ([(0,3),(0,4),(0,5),(0,6),(0,9),(0,10),(0,11),(0,12),(0,13),(0,14),(1,2),(1,4),(1,5),(1,6),(1,7),(1,8),(1,11),(1,12),(1,13),(1,14),(2,3),(2,5),(2,6),(2,7),(2,8),(2,10),(2,12),(2,13),(2,14),(3,4),(3,5),(3,7),(3,9),(3,10),(3,11),(3,12),(3,13),(3,14),(4,6),(4,8),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,7),(5,8),(5,9),(5,10),(5,12),(5,13),(6,7),(6,8),(6,9),(6,11),(6,12),(6,14),(7,8),(7,9),(7,10),(7,11),(7,13),(7,14),(8,9),(8,10),(8,11),(8,13),(8,14),(9,10),(9,11),(9,12),(9,13),(9,14),(10,11),(10,12),(10,13),(10,14),(11,12),(11,13),(11,14),(12,13),(12,14),(13,14)],15)
 => ? = 2 + 1
Description
The 1-improper chromatic number of a graph. This is the least number of colours in a vertex-colouring, such that each vertex has at most one neighbour with the same colour.
The following 14 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001743The discrepancy of a graph. St000256The number of parts from which one can substract 2 and still get an integer partition. St000480The number of lower covers of a partition in dominance order. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St001118The acyclic chromatic index of a graph. St000481The number of upper covers of a partition in dominance order. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001964The interval resolution global dimension of a poset. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001624The breadth of a lattice. St001783The number of odd automorphisms of a graph. St000264The girth of a graph, which is not a tree. 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$.