Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Integrity of the Cube is Small

Lowell W. Beineke1, Wayne Goddard2, Peter Hamburger1, Daniel J. Kleitman2, Mare J. Lipman3, Raymond E. Pippert3
1Department of Mathematical Sciences, Indiana-Purdue University at Fort Wayne, Fort Wayne IN 46805, USA
2Department of Mathematics, Massachusetts Institute of Technology, Cambridge MA 02139, USA
3Office of Naval Research, 800 North Quincy Street, Arlington VA 22217, USA
  • Published: 30/04/1991

Abstract

It is shown that the integrity of the \(n\)-dimensional cube is \(O(2^n \log n/\sqrt{n})\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Lowell W. Beineke, Wayne Goddard, Peter Hamburger, Daniel J. Kleitman, Mare J. Lipman, Raymond E. Pippert. The Integrity of the Cube is Small[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 009. 191-193. DOI: .