This web page lists papers citing my paper:

"Intersections of k-element Sets" with D.J. Kleitman and D. Sturtevant, Combinatorica, 1(1981), p. 381-384.

- P. Erdos, P. Frankl and Z. Furedi, "Families of Finite Sets in Which No Set is Covered by the Union of Two Others", Journal of Combinatorial Theory Series A, 33(1982), p. 158-166.
- P. Frankl and Z. Furedi, "Union-free Hypergraphs and Probability Theory", European Journal of Combinatorics, 5(1984), p. 127-131.
- R. Dean, "A Construction for Large Familes of k-Element Sets Having the Erdos Intersection Property", Discrete Mathematics, 53(1985), p. 55-56.
- N. Alon, "Explicit Construction of Exponential Sized Families of K-Independent Sets", Discrete Mathematics, 58(1986), p. 191-193.
- N. Linial, "Locality in Distributed Graph Algorithms", Siam Journal of Computing, 21(1992), p 193-201.
- M. Szegedy and S. Vishwanathan, "Locality based graph coloring", Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (STOC'93), 1993, p. 201-207.
- Z. Furdei, "Scrambling Permutations and Entropy of Hypergraphs", Random Structures and Algorithms, 8(1996), p. 97-104.
- J. B. Shearer, "On the Independence Number of Sparse Graphs", Random Structures and Algorithms, 7(1995), p. 269-271.

[ IBM home page | Order | Search | Contact IBM | Legal ]