{
  "abstract": "For a finite simple graph $G$, let $ν(G)$ be the maximum number of pairwise edge disjoint triangles and $τ(G)$ the minimum number of edges meeting every triangle. Tuza conjectured in 1981 that every such $G$ satisfies $τ(G) \\le 2 ν(G).$ We prove the conjecture for the class of graphs with $Δ\\le10.$",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.15269",
  "author_total": 1,
  "authors": [
    {
      "name": "Amrit Kandasamy"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0tq8ezvqx3mdx.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.15269",
  "fulltext_url": null,
  "id": "0tq8ezvqx3mdx",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.15269",
  "language": null,
  "licence": "CC-BY-NC-SA-4.0",
  "licence_label": "CC BY-NC-SA 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2607|Limits and Structures in Graph Theory"
    ]
  ],
  "openalex": "W7221753829",
  "pdf_url": "https://arxiv.org/pdf/2610.15269",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-11",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0tq8ezvqx3mdx.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:29:15Z",
      "native_id": "2610.15269",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.15269"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Tuza's Conjecture for Graphs of Maximum Degree at Most 10",
  "title_text": "Tuza's Conjecture for Graphs of Maximum Degree at Most 10",
  "type": "preprint",
  "updated_at": "2026-10-30T12:29:15Z",
  "url": "https://research.draconitic.com/paper/0tq8ezvqx3mdx",
  "venue": "arXiv",
  "versions": []
}