Identifier
Values
([],1) => ([],1) => ([],1) => ([(0,1)],2) => 1
([(0,1)],2) => ([(0,1)],2) => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 1
([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],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) => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => 1
([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],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) => 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => ([(0,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,6),(3,5),(3,6),(4,6),(5,6)],7) => 1
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
Description
The competition number of a graph.
The competition graph of a digraph $D$ is a (simple undirected) graph which has the same vertex set as $D$ and has an edge between $x$ and $y$ if and only if there exists a vertex $v$ in $D$ such that $(x, v)$ and $(y, v)$ are arcs of $D$. For any graph, $G$ together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number $k(G)$ is the smallest number of such isolated vertices.
Map
cone
Description
The cone of a graph.
The cone of a graph is obtained by joining a new vertex to all the vertices of the graph. The added vertex is called a universal vertex or a dominating vertex.
Map
to graph
Description
Returns the Hasse diagram of the poset as an undirected graph.
Map
to poset
Description
Return the poset corresponding to the lattice.