{
  "abstract": "An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The \\textit{anti-Ramsey number}, denoted by $\\ar(n,F),$ for a fixed graph $F$ and a positive integer $n$, is the maximum number of colors used in an edge-coloring of the complete graph $K_n$ that contains no rainbow copy of $F$. Meanwhile, the \\textit{Turán number}, denoted by $\\ex(n,F),$ for graph $F$ and $n$, is the maximum number of edges in an $n$-vertex graph that does not contain $F$ as a subgraph. For a vertex $v$ and a multiset $\\mathcal{H}$ of graphs, the \\textit{suspension} $\\mathcal{H} + v$ of $\\mathcal{H}$ is the graph obtained by connecting the vertex $v$ to all vertices of $H$ for each $H \\in \\mathcal{H}$. Let integers $k\\ge 1$ and $r\\ge 2$ be fixed, and suppose that $\\mathcal{H}_{k+1}=\\{H_1, H_2, \\ldots, H_{k+1}\\}+v$ satisfying $H_1, H_2, \\ldots, H_{k+1}$ are pairwise vertex-disjoint edge-critical graphs, and $χ(H_i)=r$ for $i=1,2,\\ldots, k+1$.In this paper, we determine $ \\ar(n,\\mathcal{H}_{k+1}) $ for $k\\ge 1$, $r\\ge 2$ and sufficiently large $n$. This result unifies and generalizes a result of Liu et al. (arXiv:2411.08475) concerning the friendship graph, and a result of Lu et al. (arXiv:2507.13165) on the intersecting cliques.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.29525",
  "author_total": 2,
  "authors": [
    {
      "name": "Shuchao Li"
    },
    {
      "name": "Haojie Zheng"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/crhcdww4a0fhw.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.29525",
  "fulltext_url": null,
  "id": "crhcdww4a0fhw",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.29525",
  "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": "W7204862330",
  "pdf_url": "https://arxiv.org/pdf/2608.29525",
  "pmcid": null,
  "pmid": null,
  "published": "2026-08-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/crhcdww4a0fhw.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:48Z",
      "native_id": "2608.29525",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.29525"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Anti-Ramsey Number for Suspension of Edge-Critical Graphs",
  "title_text": "Anti-Ramsey Number for Suspension of Edge-Critical Graphs",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:48Z",
  "url": "https://research.draconitic.com/paper/crhcdww4a0fhw",
  "venue": "arXiv",
  "versions": []
}