|
Search: id:A014627
|
|
|
| A014627 |
|
Consider all complete bipartite graphs on 2n nodes, and all possible assignment of weights w(i) (for nodes i=1,...,2n); sequence gives maximal number of ways to orient the edges of the graph so that each node i has w(i) edges oriented towards it (for i=1,...,2n). |
|
+0
1
|
|
| 1, 1, 2, 3, 6, 15, 90, 310, 1860, 8280, 163560, 1346940, 21476700
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
D. Z. Djokovic and J. Sanmiya, Three Identities for Symmetric Polynomials over Z/2Z, preprint, 1999.
|
|
EXAMPLE
|
For n=2 the maximal bipartite graph has two nodes on each side and the weight of every node 1. The edges form a path which can be oriented forwards or backwards to give exactly one edge oriented towards each node. Thus for n=2 the sequence value is 2.
|
|
CROSSREFS
|
Sequence in context: A001529 A069354 A007364 this_sequence A109162 A028688 A030753
Adjacent sequences: A014624 A014625 A014626 this_sequence A014628 A014629 A014630
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jason Scott Sanmiya (jssanmiy(AT)undergrad.math.uwaterloo.ca)
|
|
|
Search completed in 0.002 seconds
|
