Skip to main content
Log in

On families of faces in discrete cubes

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let ℱ be a family ofn−k-dimensional faces of the discrete cube {0,1}n such that for allF ε ℱ, F ⊄ ∪ { F′: F ≠ F′ ∈ ℱ}. It is shown that ifn≥n 0 (k) then |ℱ| ≤\(\left( {_k^n } \right)\). This was conjectured by Aharoni and Holzman and is the casem=2 of a more general result on faces of {0,...,m−1}n.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aharoni, R., Holzman, R.: Private Communication

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meshulam, R. On families of faces in discrete cubes. Graphs and Combinatorics 8, 287–289 (1992). https://doi.org/10.1007/BF02349965

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02349965

Keywords

Navigation