Skip to main content
SpringerLink
Log in

A Vertex Variant of the Kleitman-West Problem

  • Chapter
Operations Research and Discrete Analysis

Part of the book series: Mathematics and Its Applications ((MAIA,volume 391))

Abstract

We study the problem of finding an m-element set A of vertices in the nth layer of the d-dimensional unit cube with the minimum number of vertices in the nth layer lying at distance 2 from A (i.e., in the frontier of A). Our main results are lower and upper bounds on the ratio of the size of the frontier to the size of the set and exact formulas for the size of the boundaries of ideals.

This research was supported by the Russian Foundation for basic Research (Grant 93-01-01595)

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. B. Kruskal (1963) The number of simplices in a complex, Mathematical Optimization Techniques, University of California Press, Berkeley, pp. 251–278.

    Google Scholar 

  2. G. Katona (1968) A theorem of finite sets, Theory of Graphs, Akad. Kiado, Budapest, pp. 187–207.

    Google Scholar 

  3. L. H. Harper (1991) On a problem of Kleitman and West, Discrete Math. 93, No. 2-3, 169–182.

    Article  MathSciNet  MATH  Google Scholar 

  4. A. D. Korshunov (1981) The number of monotone Boolean functions (in Russian), in: Problemy Kibernetiki. Vol. 38, Nauka, Moscow, pp. 5–108.

    Google Scholar 

  5. A. A. Sapozhenko (1992) The boundary functional method for counting isoperi-metric problems (in Russian), Ph. D. Thesis, Moscow University, Moscow.

    Google Scholar 

  6. L. H. Harper (1977) Stabilization and the edgesum problem, Ars Combinato rica 4, pp. 225–270.

    MathSciNet  MATH  Google Scholar 

  7. B. List (1994) A vertex variant of the Kleitman-Vest problem (in Russian), Diploma Paper, Moscow University, Moscow.

    Google Scholar 

  8. A. A. Sapozhenko (1989) On the number of antichains in multilayered ranked sets (in Russian), Diskret. Mat. 1, No. 2, 110–128.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, Ulm University, Einstein Alley, Ulm, 89081, Germany

    B. List

Authors
  1. B. List
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

List, B. (1997). A Vertex Variant of the Kleitman-West Problem. In: Operations Research and Discrete Analysis. Mathematics and Its Applications, vol 391. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5678-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5678-3_12

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6395-1

  • Online ISBN: 978-94-011-5678-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation