{
  "abstract": "We improve the upper bound on the classical Ramsey number $R(3,3,3,3)$ from 62 to 61. The proof is based on a global incidence count, classifications of small neighborhoods and exhaustive SAT computations. We formalize the mathematical reductions in Lean and refute every resulting formula with two SAT solvers.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.36648",
  "author_total": 1,
  "authors": [
    {
      "name": "Milos Tatarevic"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/06eqcpmvtk3fq.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.36648",
  "fulltext_url": null,
  "id": "06eqcpmvtk3fq",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.36648",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2607|Limits and Structures in Graph Theory"
    ]
  ],
  "openalex": "W7224136849",
  "pdf_url": "https://arxiv.org/pdf/2610.36648",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-27",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/06eqcpmvtk3fq.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:53Z",
      "native_id": "2610.36648",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.36648"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "An upper bound of 61 for the Ramsey number $R(3,3,3,3)$",
  "title_text": "An upper bound of 61 for the Ramsey number $R(3,3,3,3)$",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:53Z",
  "url": "https://research.draconitic.com/paper/06eqcpmvtk3fq",
  "venue": "arXiv",
  "versions": []
}