Processing math: 100%

Identifier
Values
([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => ([(0,1)],2) => 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => ([(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => ([(2,4),(3,4)],5) => ([(0,1)],2) => 2
([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(3,4)],5) => ([(0,1)],2) => 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(3,4)],5) => ([(0,1)],2) => 2
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6) => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6) => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6) => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 2
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6) => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6) => ([(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 2
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6) => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6) => ([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 2
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => ([(3,5),(4,5)],6) => ([(0,1)],2) => 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => ([(4,5)],6) => ([(0,1)],2) => 2
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6) => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6) => ([(2,5),(3,5),(4,5)],6) => ([(0,1)],2) => 2
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => ([(4,5)],6) => ([(0,1)],2) => 2
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => ([(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 2
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => ([(4,5)],6) => ([(0,1)],2) => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6) => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6) => ([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 2
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6) => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6) => ([(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1)],2) => 2
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(0,1)],2) => 2
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => ([(3,5),(4,5)],6) => ([(0,1)],2) => 2
search for individual values
searching the database for the individual values of this statistic
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 poset
Description
Return the poset corresponding to the lattice.
Map
incomparability graph
Description
The incomparability graph of a poset.
Map
core
Description
The core of a graph.
The core of a graph G is the smallest graph C such that there is a homomorphism from G to C and a homomorphism from C to G.
Note that the core of a graph is not necessarily connected, see [2].