{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T01:47:18Z","timestamp":1777081638286,"version":"3.51.4"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The Tur\u00e1n number of a graph $H$, $\\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $\\mathcal{F}$ of graphs, the suspension $\\mathcal{F}+v$ of $\\mathcal{F}$ is the graph obtained by connecting the vertex $v$ to all vertices of $F$ for each $F\\in \\mathcal{F}$. For two integers $k\\ge1$ and $r\\ge2$, let $H_i$ be a graph containing a critical edge with chromatic number $r$ for any $i\\in\\{1,\\ldots,k\\}$, and let $H=\\{H_1,\\ldots,H_k\\}+v$. In this paper, we determine $\\text{ex}(n, H)$ and characterize all the extremal graphs for sufficiently large $n$. This generalizes a result of Chen, Gould, Pfender and Wei on intersecting cliques.<\/jats:p>","DOI":"10.37236\/12223","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T12:33:07Z","timestamp":1732797187000},"source":"Crossref","is-referenced-by-count":3,"title":["Extremal Graphs for the Suspension of Edge-Critical Graphs"],"prefix":"10.37236","volume":"31","author":[{"given":"Jianfeng","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghou","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2024,11,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i4p55\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i4p55\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T12:33:07Z","timestamp":1732797187000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i4p55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,10,3]]}},"URL":"https:\/\/doi.org\/10.37236\/12223","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"article-number":"P4.55"}}