On the public citation graph

Ein Satz �ber Untermengen einer endlichen Menge

https://doi.org/10.1007/bf01171114
0 signed · 841 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4814557openalex-extracted
On Supersaturation of Eventown Problems
inferred← citeshttps://doi.org/10.2139/ssrn.4857050openalex-extracted
The exact values of Ramsey and anit-Ramsey numbers for some posets
inferred← citeshttps://doi.org/10.1002/(sici)1097-0312(199703)50:3<205::aid-cpa1>3.0.co;2-fopenalex-snapshot
A continuous analogue of Sperner's theorem
inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(1999)7:3<185::aid-jcd3>3.0.co;2-3openalex-snapshot
New recursive methods for transversal covers
inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/cpa.3160230305openalex-snapshot
On the counting problem for monotone boolean functions
inferred← citeshttps://doi.org/10.1002/cpa.3160360507openalex-snapshot
On the erdos‐wintner theorem of probabilistic number theory
inferred← citeshttps://doi.org/10.1002/cpa.3160400606openalex-snapshot
Continuity of the distribution function of the sum of an additive and a multiplicative arithmetic function
inferred← citeshttps://doi.org/10.1002/em.2860070103openalex-snapshot
Screening program theory: Decision functions and protocols
inferred← citeshttps://doi.org/10.1002/jcd.10059openalex-snapshot
Covering arrays with mixed alphabet sizes
inferred← citeshttps://doi.org/10.1002/jcd.21330openalex-snapshot
Sperner Partition Systems
inferred← citeshttps://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
inferred← citeshttps://doi.org/10.1002/jcd.70022openalex-snapshot
Lower Bounds and Construction of Detecting Arrays
inferred← citeshttps://doi.org/10.1002/jgt.20189openalex-snapshot
Arc‐chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
inferred← citeshttps://doi.org/10.1002/jgt.22529openalex-snapshot
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
inferred← citeshttps://doi.org/10.1002/jgt.23238openalex-snapshot
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
inferred← citeshttps://doi.org/10.1002/jgt.3190070414openalex-snapshot
On a product dimension of bipartite graphs
inferred← citeshttps://doi.org/10.1002/net.21977openalex-snapshot
Network reliability: Heading out on the highway
inferred← citeshttps://doi.org/10.1002/rsa.20399openalex-snapshot
Turánnical hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.20647openalex-snapshot
Maximum-size antichains in random set-systems
inferred← citeshttps://doi.org/10.1002/rsa.20666openalex-snapshot
Applications of graph containers in the Boolean lattice
inferred← citeshttps://doi.org/10.1002/rsa.20952openalex-snapshot
Existence thresholds and Ramsey properties of random posets
inferred← citeshttps://doi.org/10.1002/rsa.20977openalex-snapshot
On the Littlewood‐Offord problem for arbitrary distributions
inferred← citeshttps://doi.org/10.1002/rsa.21034openalex-snapshot
Uniform chain decompositions and applications
inferred← citeshttps://doi.org/10.1002/rsa.21259openalex-snapshot
A Sharp Threshold for a Random Version of Sperner's Theorem
inferred← citeshttps://doi.org/10.1002/rsa.3240060109openalex-snapshot
Large antichains in the partition lattice
inferred← citeshttps://doi.org/10.1002/sapm1974533239openalex-snapshot
A Generalized Rota Conjecture for Partitions
inferred← citeshttps://doi.org/10.1002/sapm1976554361openalex-snapshot
A Note on Uniquely lntersectable Graphs
inferred← citeshttps://doi.org/10.1002/sapm1977572181openalex-snapshot
Another Three Part Sperner Theorem
inferred← citeshttps://doi.org/10.1006/jcta.1996.0012openalex-snapshot
Onr-Cover-free Families
inferred← citeshttps://doi.org/10.1006/jcta.1996.0041openalex-snapshot
Optimal Pooling Designs with Error Detection
inferred← citeshttps://doi.org/10.1006/jcta.1998.2871openalex-snapshot
The Size of the Largest Antichain in the Partition Lattice
inferred← citeshttps://doi.org/10.1006/jcta.2002.3295openalex-snapshot
A Shorter, Simpler, Stronger Proof of the Meshalkin–Hochberg–Hirsch Bounds on Componentwise Antichains
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_3openalex-snapshot
An Incremental Learning Algorithm for Inferring Logical Rules from Examples in the Framework of the Common Reasoning Process
inferred← citeshttps://doi.org/10.1007/11663881_6openalex-snapshot
On the Number of Independent Functional Dependencies
inferred← citeshttps://doi.org/10.1007/2-287-33846-2_23openalex-snapshot
Trois théorèmes célèbres sur les ensembles finis
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_24openalex-snapshot
Die Grösse des zustandsminimalen LR(O)-Analysators
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_11openalex-snapshot
Extremal combinatorial problems in relational data base
inferred← citeshttps://doi.org/10.1007/3-540-19121-6_7openalex-snapshot
Extremal combinatorial problems of database models
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/3-540-39799-x_36openalex-snapshot
Some Cryptographic Aspects of Womcodes
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_9openalex-snapshot
Directed Acyclic Graphs, One-way Functions and Digital Signatures
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_58openalex-snapshot
Parallel algorithms for linked list and beyond
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_30openalex-snapshot
Combinatorial and algebraic results for database relations
inferred← citeshttps://doi.org/10.1007/3-540-63594-7_76openalex-snapshot
SVP: A flexible micropayment scheme
inferred← citeshttps://doi.org/10.1007/88-470-0451-9_23openalex-snapshot
Tre celebri teoremi sugli insiemi finiti
inferred← citeshttps://doi.org/10.1007/978-0-8176-4842-8_27openalex-snapshot
A Theorem of Finite Sets
inferred← citeshttps://doi.org/10.1007/978-0-8176-4842-8_28openalex-snapshot
A Short Proof of Sperner’s Lemma
inferred← citeshttps://doi.org/10.1007/978-0-8176-4842-8_30openalex-snapshot
A Generalization of a Combinatorial Theorem of Macaulay
inferred← citeshttps://doi.org/10.1007/978-0-8176-8206-4_33openalex-snapshot
Sur l’Inégalité de Concentration de Doeblin — Lé vy, Rogozin — Kesten
inferred← citeshttps://doi.org/10.1007/978-1-4471-6407-4_3openalex-snapshot
Combinatorics
inferred← citeshttps://doi.org/10.1007/978-1-4612-2070-1_40openalex-snapshot
A Continuous Analogue of Sperner’s Theorem
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_37openalex-snapshot
Immutable Codes
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_40openalex-snapshot
On the Maximality of the Group Theoretic Single Error Correcting and All Unidirectional Error Detecting (SEC-AUED) Codes
inferred← citeshttps://doi.org/10.1007/978-1-4613-8227-0_5openalex-snapshot
Primitive Sequences and Sets of Multiples
inferred← citeshttps://doi.org/10.1007/978-1-4614-6998-8_4openalex-snapshot
The Sperner Property
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_9openalex-snapshot
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences
inferred← citeshttps://doi.org/10.1007/978-1-4615-4819-5_6openalex-snapshot
Über Folgen Ganzer Zahlen
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_3openalex-snapshot
Enumeration in geometric lattices
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_13openalex-snapshot
The Cycle Method and Its Limits
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_27openalex-snapshot
A Counterexample to the Generalization of Sperner’s Theorem
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_30openalex-snapshot
The Sperner Property in Geometric and Partition Lattices
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_10openalex-snapshot
Couplage maximum
inferred← citeshttps://doi.org/10.1007/978-2-8178-0400-2_27openalex-snapshot
Trois théorèmes célèbres sur les ensembles finis
inferred← citeshttps://doi.org/10.1007/978-3-030-00979-3_44openalex-snapshot
Algorithms for a Bit-Vector Encoding of Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_5openalex-snapshot
An Automata-Based View on Configurability and Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_27openalex-snapshot
Robustly Assigning Unstable Items
inferred← citeshttps://doi.org/10.1007/978-3-030-18174-1_10openalex-snapshot
Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_8openalex-snapshot
MUST: Minimal Unsatisfiable Subsets Enumeration Tool
inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_21openalex-snapshot
Approximate Counting of Minimal Unsatisfiable Subsets
inferred← citeshttps://doi.org/10.1007/978-3-030-58373-6_3openalex-snapshot
On Finite Dimensional $$\mathfrak {sl}(2)$$ Representations and an Application to Algebraic Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_3openalex-snapshot
Replication-Guided Enumeration of Minimal Unsatisfiable Subsets
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_16openalex-snapshot
Timed Automata Relaxation for Reachability
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_27openalex-snapshot
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_15openalex-snapshot
Counting Minimal Unsatisfiable Subsets
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_30openalex-snapshot
Supersaturation, Counting, and Randomness in Forbidden Subposet Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-16681-5_5openalex-snapshot
Formalising the Kruskal-Katona Theorem in Lean
inferred← citeshttps://doi.org/10.1007/978-3-031-21696-1_15openalex-snapshot
The Power of Closeness in a Network
inferred← citeshttps://doi.org/10.1007/978-3-031-35355-0_12openalex-snapshot
Minimal Generating Sets for Semiflows
inferred← citeshttps://doi.org/10.1007/978-3-031-38554-4_15openalex-snapshot
Revisiting the Constant-Sum Winternitz One-Time Signature with Applications to $$\text {SPHINCS}^+$$ and XMSS
inferred← citeshttps://doi.org/10.1007/978-3-031-40960-8_6openalex-snapshot
A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_11openalex-snapshot
A Survey of Cover-Free Families: Constructions, Applications, and Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-032-00828-2_8openalex-snapshot
Certified Enumeration of AI Explanations: A Focus on Monotonic Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-032-18810-6_3openalex-snapshot
Monotone Boolean Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_9openalex-snapshot
Vertex-Critical Graphs in Subfamilies of $$(P_4+\ell P_1)$$-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_3openalex-snapshot
Old and New Perspectives on Petri Nets Flows
inferred← citeshttps://doi.org/10.1007/978-3-0348-5321-7_5openalex-snapshot
Linear Decomposition of a Positive Group-Boolean Function
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_13openalex-snapshot
Some Remarks on a Classification of Oracle-Type-Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-01315-2_10openalex-snapshot
A Quasi Ramsey Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-01315-2_18openalex-snapshot
Density Hales-Jewett Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_14openalex-snapshot
Progress on poset-free families of subsets
inferred← citeshttps://doi.org/10.1007/978-3-319-28186-5_27openalex-snapshot
What Is the Minimal Cardinal of a Family Which Shatters All d-Subsets of a Finite Set?
inferred← citeshttps://doi.org/10.1007/978-3-319-41114-9_6openalex-snapshot
On the State Complexity of the Shuffle of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-53139-7_3openalex-snapshot
Results for Classical Extremal Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_37openalex-snapshot
An Optimization Problem Related to Bloom Filters with Bit Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-77173-1_4openalex-snapshot
The Sperner Property
inferred← citeshttps://doi.org/10.1007/978-3-319-78235-5_7openalex-snapshot
Pure Unary Relational Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-90050-6_3openalex-snapshot
Compilation of Conditional Knowledge Bases for Computing C-Inference Relations
inferred← citeshttps://doi.org/10.1007/978-3-319-91473-2_10openalex-snapshot
Efficient Binary Fuzzy Measure Representation and Choquet Integral Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-92777-0_4openalex-snapshot
On the Difference in Values of the Euler Totient Function Near Prime Arguments
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_5openalex-snapshot
Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families
inferred← citeshttps://doi.org/10.1007/978-3-322-80265-1_2openalex-snapshot
Diskrete Mathematik
inferred← citeshttps://doi.org/10.1007/978-3-322-89870-8_9openalex-snapshot
Zuverlässigkeit von Netzen
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_1openalex-snapshot
A Unifying Generalization of Sperner’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-74958-5_17openalex-snapshot
The Cost of Learning Directed Cuts
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_10openalex-snapshot
Maximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-77200-2_6openalex-snapshot
Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
inferred← citeshttps://doi.org/10.1007/978-3-642-00856-6_27openalex-snapshot
Three famous theorems on finite sets
inferred← citeshttps://doi.org/10.1007/978-3-642-02259-3_27openalex-snapshot
Drei berühmte Sätze über endliche Mengen
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_12openalex-snapshot
Reconstructing Weighted Graphs with Minimal Query Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_22openalex-snapshot
Density Hales-Jewett and Moser Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_12openalex-snapshot
Group Testing and Batch Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_28openalex-snapshot
On the Efficiency of Bit Commitment Reductions
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_18openalex-snapshot
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_23openalex-snapshot
On the Advice Complexity of the Set Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-31709-5_5openalex-snapshot
On the VC-Dimension of the Choquet Integral
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_7openalex-snapshot
Combinatorial Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-36899-8_17openalex-snapshot
Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2openalex-snapshot
Lefschetz Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_1openalex-snapshot
Poset Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_2openalex-snapshot
Basics on the Theory of Local Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_4openalex-snapshot
Complete Intersections with the SLP
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_5openalex-snapshot
A Generalization of Lefschetz Elements
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_6openalex-snapshot
k-Lefschetz Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_7openalex-snapshot
Cohomology Rings and the Strong Lefschetz Property
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_8openalex-snapshot
Invariant Theory and Lefschetz Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_9openalex-snapshot
The Strong Lefschetz Property and the Schur–Weyl Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_18openalex-snapshot
On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_47openalex-snapshot
Linear Inequalities Describing the Class of Intersecting Sperner Families of Subsets, I
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_65openalex-snapshot
On an Inequality of Sperner
inferred← citeshttps://doi.org/10.1007/978-3-642-54373-9_8openalex-snapshot
On the Maximal and Average Numbers of Stable Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-60408-9_9openalex-snapshot
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_9openalex-snapshot
Graham-Rothschild Parameter Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-95113-8_5openalex-snapshot
Der Heiratssatz
inferred← citeshttps://doi.org/10.1007/978-3-662-04315-8_22openalex-snapshot
Three famous theorems on finite sets
inferred← citeshttps://doi.org/10.1007/978-3-662-05412-3_23openalex-snapshot
Three famous theorems on finite sets
inferred← citeshttps://doi.org/10.1007/978-3-662-06452-8_23openalex-snapshot
Drei berühmte Sätze über endliche Mengen
inferred← citeshttps://doi.org/10.1007/978-3-662-06454-2_22openalex-snapshot
Drei berühmte Sätze über endliche Mengen
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-22343-7_21openalex-snapshot
Three famous theorems on finite sets
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-57767-7_30openalex-snapshot
Drei berühmte Sätze über endliche Mengen
inferred← citeshttps://doi.org/10.1007/978-3-663-12018-6openalex-snapshot
Dependencies in Relational Databases
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_10openalex-snapshot
Matching Massimo
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_10openalex-snapshot
Ordered Ranked Posets, Representations of Integers and Inequalities from Extremal Poset Problems
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_16openalex-snapshot
Extremal Problems in Partially Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-010-1826-5_11openalex-snapshot
Extremal Problems for Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-94-010-1826-5_14openalex-snapshot
On An Extremal Property of Antichains in Partial Orders. The Lym Property and Some of Its Implications and Applications
inferred← citeshttps://doi.org/10.1007/978-94-010-1826-5_15openalex-snapshot
Sperner Families and Partitions of A Partially Ordered Set
inferred← citeshttps://doi.org/10.1007/bf00052112openalex-snapshot
m-contiguities. I
inferred← citeshttps://doi.org/10.1007/bf00053696openalex-snapshot
m-Contiguities. III
inferred← citeshttps://doi.org/10.1007/bf00114418openalex-snapshot
m-contiguities. II
inferred← citeshttps://doi.org/10.1007/bf00396270openalex-snapshot
Maximum antichains in the product of chains
inferred← citeshttps://doi.org/10.1007/bf00969068openalex-snapshot
Limiting distribution of additive functions
inferred← citeshttps://doi.org/10.1007/bf01072167openalex-snapshot
Extremal problems in relational data bases
inferred← citeshttps://doi.org/10.1007/bf01111741openalex-snapshot
The normalized matching property from the generalized Macaulay theorem
inferred← citeshttps://doi.org/10.1007/bf01111746openalex-snapshot
The poset on connected induced subgraphs of a graph need not be Sperner
inferred← citeshttps://doi.org/10.1007/bf01142579openalex-snapshot
Choice mappings of certain classes of finite sets
inferred← citeshttps://doi.org/10.1007/bf01147626openalex-snapshot
Papers read at the third Soviet - Japanese symposium on probability theory and mathematical statistics, Tashkent, August?September, 1975
inferred← citeshttps://doi.org/10.1007/bf01195325openalex-snapshot
Sperner capacities
inferred← citeshttps://doi.org/10.1007/bf01202350openalex-snapshot
A generalization of the AZ identity
inferred← citeshttps://doi.org/10.1007/bf01285817openalex-snapshot
Sharpening the LYM inequality
inferred← citeshttps://doi.org/10.1007/bf01304071openalex-snapshot
Symmetrische Zerlegung von Kettenprodukten
inferred← citeshttps://doi.org/10.1007/bf01305241openalex-snapshot
The convex hull of antichains in posets
inferred← citeshttps://doi.org/10.1007/bf01450084openalex-snapshot
Minimale Erzeugendensysteme und minimale Primteiler von monomialen Radikalidealen
inferred← citeshttps://doi.org/10.1007/bf01462228openalex-snapshot
Applications of the symmetric chain decomposition of the lattice of divisors
inferred← citeshttps://doi.org/10.1007/bf01556350openalex-snapshot
A survey of some combinatorial results concerning functional dependencies in database relations
inferred← citeshttps://doi.org/10.1007/bf01624080openalex-snapshot
Two classes of intermediate propositional logics without disjunction property
inferred← citeshttps://doi.org/10.1007/bf01626030openalex-snapshot
Proof of a conjecture on the Sperner property of the subgroup lattice of an abelianp-group
inferred← citeshttps://doi.org/10.1007/bf01788086openalex-snapshot
Convex hulls of more-part Sperner families
inferred← citeshttps://doi.org/10.1007/bf01788547openalex-snapshot
The maximum number of balancing sets
inferred← citeshttps://doi.org/10.1007/bf01788562openalex-snapshot
Delay-insensitive codes — an overview
inferred← citeshttps://doi.org/10.1007/bf01788682openalex-snapshot
Traces of antichains
inferred← citeshttps://doi.org/10.1007/bf01789460openalex-snapshot
Shadows and shifting
inferred← citeshttps://doi.org/10.1007/bf01849615openalex-snapshot
Sperner type theorems and complexity of minimal disjunctive normal forms of monotone boolean functions
inferred← citeshttps://doi.org/10.1007/bf01864160openalex-snapshot
Matchings and covers in hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01896428openalex-snapshot
Minimal scrambling sets of simple orders
inferred← citeshttps://doi.org/10.1007/bf01956320openalex-snapshot
Monochromatic directed walks in arc-colored directed graphs
inferred← citeshttps://doi.org/10.1007/bf02018457openalex-snapshot
Two applications (for search theory and truth functions) of Sperner type theorems
inferred← citeshttps://doi.org/10.1007/bf02392300openalex-snapshot
An extended Euler-Poincaré theorem
inferred← citeshttps://doi.org/10.1007/bf02454163openalex-snapshot
On uniqueness of maximal antichains of subsets of a multiset
inferred← citeshttps://doi.org/10.1007/bf02579153openalex-snapshot
Intersecting sperner families and their convex hulls
inferred← citeshttps://doi.org/10.1007/bf02579186openalex-snapshot
Density theorems for finitistic trees
inferred← citeshttps://doi.org/10.1007/bf02579438openalex-snapshot
Extremal hypergraph problems and convex hulls
inferred← citeshttps://doi.org/10.1007/bf02582927openalex-snapshot
On the addressing problem for directed graphs
inferred← citeshttps://doi.org/10.1007/bf02582928openalex-snapshot
A Ramsey-Sperner theorem
inferred← citeshttps://doi.org/10.1007/bf02620229openalex-snapshot
Multiple assignment scheme for sharing secret
inferred← citeshttps://doi.org/10.1007/bf02772959openalex-snapshot
Families of finite sets in which no set is covered by the union ofr others
inferred← citeshttps://doi.org/10.1007/bf02878435openalex-snapshot
Strong Sperner property of the subgroup lattice of an Abelianp-group
inferred← citeshttps://doi.org/10.1007/bf03023067openalex-snapshot
Maximum antichains in the partition lattice
inferred← citeshttps://doi.org/10.1007/bf03041066openalex-snapshot
A density version of the Hales-Jewett theorem
inferred← citeshttps://doi.org/10.1007/bfb0053420openalex-snapshot
The size of a share must be large
inferred← citeshttps://doi.org/10.1007/bfb0054150openalex-snapshot
Combinatorial bounds for broadcast encryption
inferred← citeshttps://doi.org/10.1007/bfb0061502openalex-snapshot
The concentration functions of sums of independent random variables
showing the first 200 of 841 · page through all 841
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.