Information Technology Reference
In-Depth Information
[Hoo02] S. Hoory, The size of bipartite graphs with a given girth. J. Comb. Theory, Ser. B,
86
(2):215-220 (2002)
[Kah02] J. Kahn, Entropy, independent sets and antichains: a newapproach toDedekind's problem.
Proc. Amer. Math. Soc.
130
, 371-378 (2002)
[LL13] N. Linial, Z. Luria, Upper bounds on the number of Steiner triple systems and
1-factorizations. Random Struct. Algorithms
43
, 399-406 (2013)
[Rad99] J. Radhakrishnan, An entropy proof of Bregman's theorem. J. Comb. Theor. A
77
(1),
161-164 (1999)
[Rad01] J. Radhakrishnan, Entropy and counting, in
IIT Kharagpur Golden Jubilee Volume on
Computational Mathematics, Modelling and Algorithms
, ed. by J.C. Mishra (Narosa
Publishers, New Delhi, 2001)
