The DOI matches its Crossref record.
Cores in random hypergraphs and Boolean formulas
Abstract
We describe a technique for determining the thresholds for the appearance of cores in random structures. We use it to determine (i) the threshold for the appearance of a k‐core in a random r‐uniform hypergraph for all r, k≥ 2,r+k> 4, and (ii) the threshold for the pure literal rule to find a satisfying assignment for a random instance of r‐SAT,r≥ 3. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Efficient core decomposition in massive networks
Cheng, J., Ke, Y., Chu, S., & Ozsu, M. T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767911 · Cited by 266
Metadata
- Authors
- Molloy, M.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 2005-03-04
- Volume
- 27
- Issue
- 1
- Pages
- 124-135
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2047467760
- Cited by
- 168
- References
- 0
- FWCI
- 7.32
- 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.