Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. D. Duffus, P. Frankl and V. Rödl: Maximal independent sets in the covering graph of the cube, Discrete Appl. Math 161 (2013), 1203–1208.
2. P. Erdős, D. J. Kleitman and B. L. Rothschild: Asymptotic enumeration of Kn-free graphs, in: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973) Tomo II, Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 19–27, 1976.
3. D. Galvin: On homomorphisms from the Hamming cube to Z, Israel J. Math 138 (2003), 189–213.
4. D. Galvin: Independent sets in the discrete hypercube, arXiv:1901.01991 [math.CO]
5. D. Galvin and J. Kahn: On phase transition in the hard-core model on ℤd, Combin. Probab. Comput. 13 (2004), 137–164.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献