Author:
Johnson J. Robert,Wickes Belinda
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory,Discrete Mathematics and Combinatorics
Reference12 articles.
1. Alon, N.: Explicit construction of exponential sized families of k-independent sets. Discret. Math. 58(2), 191–193 (1986)
2. Chung, F., Graham, R., Winkler, P.: On the Addressing Problem for Directed Graphs. Graphs Comb. 1, 41–50 (1985)
3. Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)
4. Füredi, Z.: Scrambling permutations and entropy of hypergraphs. Random Struct. Algorithm. 8(2), 97–104 (1996)
5. Kleitman, D., Spencer, J.: Families of k-independent sets. Discret. Math. 6(3), 255–262 (1973)