The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Families of finite sets in which no set is covered by the union ofr others
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Erdős, P. L., Ko, C., & Rado, R. (1961) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/12.1.313 · Cited by 1,351
Self-citationCombinatorial properties of systems of sets
Erdös, P., & Szemerédi, E. (1978) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(78)90060-2 · Cited by 54
Self-citation
Cited by
Public Key Encryption with Keyword Search
Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_30 · Cited by 3,134
Conjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
Collusion-secure fingerprinting for digital data
Boneh, D., & Shaw, J. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705568 · Cited by 980
Key-Insulated Public Key Cryptosystems
Dodis, Y., Katz, J., Xu, S., & Yung, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_5 · Cited by 400
Chor, B., Fiat, A., & Naor, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_25 · Cited by 366
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
Zhu, S., Xu, S., Setia, S., & Jajodia, S. (2004) · 11th IEEE International Conference on Network Protocols, 2003. Proceedings. · doi:10.1109/icnp.2003.1249782 · Cited by 344
Chor, B., Fiat, A., Naor, M., & Pinkas, B. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841169 · Cited by 304
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
Stinson, D. R., & Wei, R. (1998) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480196304246 · Cited by 275
Extracting all the randomness and reducing the error in Trevisan's extractors
Raz, R., Reingold, O., & Vadhan, S. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301292 · Cited by 171
Metadata
- Authors
- Erdös, P., Frankl, P., & Füredi, Z.
- Venue
- Israel Journal of Mathematics
- Published
- 1985-12
- Volume
- 51
- Issue
- 1-2
- Pages
- 79-89
- ISSN
- 0021-2172 (ISSN-L)
- 1565-8511
- OpenAlex
- W2164604747
- Cited by
- 440
- References
- 2
- FWCI
- 5.02
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.