Identifier
Values
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => 3
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(4,5)],6) => 4
['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) => 3
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
click to show known generating functions       
Description
The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph.
The deck of a graph is the multiset of induced subgraphs obtained by deleting a single vertex.
The graph reconstruction conjecture states that the deck of a graph with at least three vertices determines the graph.
This statistic is only defined for graphs with at least two vertices, because there is only a single graph of the given size otherwise.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
Map
incomparability graph
Description
The incomparability graph of a poset.