On the Capacity of Digraphs

For a digraph G = (V, E) let w(Gn ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair (u1, u2, . . . , un) and (v1, v2, . . . , vn) of members of S there is some 1 ≤ i ≤ n such that (ui, vi) ∈ E. The capacity C(G) of G is C(G) = limn→∞[ (w(Gn ))1/n ].

• Type: Journal
• Year: 1998
• Where: EJC
• Authors: Noga Alon
• Keywords: EJC 1998, Information Technology, Maximum Possible Cardinality