On conjectures of Graffiti
Open accessThe DOI matches its Crossref record.
Abstract
Publisher Summary Graffiti is a computer program that makes graph-theoretical conjectures. The basic idea of Graffiti is that it “knows” certain graphs and it is capable of evaluating certain formulas formed from graph-theoretical invariants. If none of the graphs with which Graffiti is familiar is a counterexample to a formula then the formula is considered to be a conjecture. The number of conjectures, particularly those that are completely trivial, is the main problem and more than half of the program consists of various heuristics whose purpose is deletion of trivial and otherwise noninteresting but true conjectures. All conclusions that Graffiti draws are based exclusively on graphs it knows, so “follows” means of course “follows as far as the graphs in the library of program are concerned.” CNCL deletes those conjectures of the second and third type in which one of the invariants on the left is always smaller than an invariant on the right. This procedure may undoubtedly remove a number of interesting conjectures but it is the only one that seems to operate completely independently from IRIN.
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
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Variable neighborhood search: Principles and applications
Hansen, P., & Mladenović, N. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00100-4 · Cited by 1,902
Aromaticity of Polycyclic Conjugated Hydrocarbons
Randić, M. (2003) · Chemical Reviews · doi:10.1021/cr9903656 · Cited by 765
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
Advancing mathematics research with AI-driven formal proof search
Tsoukalas, G., Kovsharov, A., Shirobokov, S., Surina, A., Firsching, M., Bérczi, G., Ruiz, F. J. R., Suggala, A., Wagner, A. Z., Wieser, E., et al. (2026) · Science · doi:10.1126/science.aej2213 · Cited by 62
Metadata
- Authors
- Fajtlowicz, S.
- Venue
- Discrete Mathematics
- Publisher
- Elsevier BV
- Published
- 1988-12
- Volume
- 72
- Issue
- 1-3
- Pages
- 113-118
- ISSN
- 0012-365X (ISSN-L)
- OpenAlex
- W2089188009
- Cited by
- 289
- References
- 0
- FWCI
- 0.48
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On conjectures of Graffiti. https://app.cochat.ai/papers/10.1016/0012-365x(88)90199-9
- The paper
- Fajtlowicz, S. (1988). On conjectures of Graffiti. Discrete Mathematics. https://doi.org/10.1016/0012-365x(88)90199-9
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.