The DOI matches its Crossref record.
On cliques in graphs
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
Cited by
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Overlapping community detection in networks: The state-of-the-art and comparative study
Xie, J., Kelley, S., & Szymanski, B. K. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501657 · Cited by 930
Overlapping Community Detection in Networks: the State of the Art and Comparative Study
Xie, J., Kelley, S., & Szymanski, B. K. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.5813 · Cited by 865
The worst-case time complexity for generating all maximal cliques and computational experiments
Tomita, E., Tanaka, A., & Takahashi, H. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.06.015 · Cited by 771
Exact Algorithms for NP-Hard Problems: A Survey
Woeginger, G. J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36478-1_17 · Cited by 652
Shepard, R. N., & Arabie, P. (1979) · Psychological Review · doi:10.1037//0033-295x.86.2.87 · Cited by 476
Fomin, F. V., & Kratsch, D. (2010) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/978-3-642-16533-7 · Cited by 471
Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
Coleman, T. F., & Moré, J. J. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720013 · Cited by 468
Read, R. C., & Corneil, D. G. (1977) · Journal of Graph Theory · doi:10.1002/jgt.3190010410 · Cited by 453
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Eppstein, D., Löffler, M., & Strash, D. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17517-6_36 · Cited by 356
Steiner's problem in graphs and its implications
Hakimi, S. L. (1971) · Networks · doi:10.1002/net.3230010203 · Cited by 347
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Balasundaram, B., Butenko, S., & Hicks, I. V. (2011) · Operations Research · doi:10.1287/opre.1100.0851 · Cited by 302
The tidy set: a minimal simplicial set for computing homology of clique complexes
Zomorodian, A. (2010) · Proceedings of the twenty-sixth annual symposium on Computational geometry · doi:10.1145/1810959.1811004 · Cited by 52
Polaritonic machine learning for graph-based data analysis
Wang, Y., Scali, S., & Kyriienko, O. (2026) · Physical Review E · doi:10.1103/fgy1-n4vp
Metadata
- Authors
- Moon, J. W., & Moser, L.
- Venue
- Israel Journal of Mathematics
- Published
- 1965-03
- Volume
- 3
- Issue
- 1
- Pages
- 23-28
- ISSN
- 0021-2172 (ISSN-L)
- 1565-8511
- OpenAlex
- W2013568176
- Cited by
- 837
- References
- 0
- FWCI
- 0.56
- 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.