Bollobas, Bela; Rival, Ivan The maximal size of the covering graph of a lattice. (English) Zbl 0424.05045 Algebra Univers. 9, 371-373 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 8 Documents MSC: 05C99 Graph theory 06A06 Partial orders, general 06B15 Representation theory of lattices Keywords:covering graph of a lattice PDFBibTeX XMLCite \textit{B. Bollobas} and \textit{I. Rival}, Algebra Univers. 9, 371--373 (1979; Zbl 0424.05045) Full Text: DOI References: [1] S. Hart,A note on the edges of the n-cube, Discr. Math.14 (1976), 157–163. · Zbl 0363.05058 · doi:10.1016/0012-365X(76)90058-3 [2] M. N. Huxley,On the difference between consecutive primes, Invent. Math.15 (1972), 164–170. · Zbl 0241.10026 · doi:10.1007/BF01418933 [3] P. Turán,On the theory of graphs, Coll. Math.3 (1954), 19–30. · Zbl 0055.17004 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.