Skip to main content
SpringerLink
Log in

Minimal scrambling sets of simple orders

  • Published:
Acta Mathematica Academiae Scientiarum Hungaricae Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. B. Dushnik, Concerning a Certain Set of Arrangements,Proc Amer. Math. Soc.,1 (1950), pp. 788–796.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Erdös, A. Hajnal, R. Rado, Partition Relations for Cardinal Numbers,Acta Math. Acad. Sci. Hung.,16 (1965), pp. 93–196.

    Article  MATH  Google Scholar 

  3. P. Erdös, Chao Ko andR. Rado, Intersection Theorems for Systems of Finite Sets,Quart. J. Math. Oxford (2)12 (1961), pp. 313–320.

    Article  MATH  Google Scholar 

  4. P. Erdös, G. Szekeres, A Combinatorial Problem in Geometry,Composition Math.,2 (1935), pp. 463–470.

    Google Scholar 

  5. E. Sperner, Ein Satz über Untermengen einer endichen Menge,Math. Z.,27 (1928), pp. 544–548.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Rand Corporation, 1700 Main Street, 90406, California, Santa Monica, USA

    J. Spencer

Authors
  1. J. Spencer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spencer, J. Minimal scrambling sets of simple orders. Acta Mathematica Academiae Scientiarum Hungaricae 22, 349–353 (1971). https://doi.org/10.1007/BF01896428

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation