Minimal scrambling sets of simple orders

1972/09/01 by J. Spencer · 4 citations
Mathematics · #Algorithm #Analytic Number Theory Research #Combinatorics #Limits and Structures in Graph Theory #Mathematics #Mathematics and Applications #Scrambling #Simple (philosophy)

paper · doi:10.1007/bf01896428

crossref issued 1972/09/01 · crossref published 1972/09/01 · crossref published-print 1972/09/01 · openalex publication_date 1972/09/01 · crossref created 2005/07/07 · crossref deposited 2019/05/10 · openalex created_date 2025/10/10 · crossref indexed 2026/05/06 · openalex updated_date 2026/07/22

Citations

• A Combinatorial Problem in Geometry
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Ein Satz �ber Untermengen einer endlichen Menge

Cited by

• The order dimension of the complete graph
• The Order Dimension of Convex Polytopes
• The complexity of counting poset and permutation patterns
• Schnyder's theorem [wikipedia]