Counting triangles in graphs without vertex disjoint odd cycles
Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices is denoted by $\mathrm{ex}(n, H, F)$. Let $(\ell+1) \cdot F$ denote $\ell+1$ vertex disjoint copies of $F$. In this paper, we determine the exact value of $\mathrm{ex}(n, C_3, (\ell+1)\cdo...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Hou, Jianfeng Yang, Caihong Zeng, Qinghou |
| description | Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in
an $F$-free graph on $n$ vertices is denoted by $\mathrm{ex}(n, H, F)$. Let
$(\ell+1) \cdot F$ denote $\ell+1$ vertex disjoint copies of $F$. In this
paper, we determine the exact value of $\mathrm{ex}(n, C_3, (\ell+1)\cdot
C_{2k+1})$ and its extremal graph, which generalizes some known results. |
| doi_str_mv | 10.48550/arxiv.2310.19048 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2310_19048</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2310_19048</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-dc638808141ba902fa035db28db47d47021f4200982f2a91d866d2ebe994bbd23</originalsourceid><addsrcrecordid>eNotz8tqwzAUBFBtsihpP6Cr6gecXj1sX61KMH1BoJvsjeQrOyqpHGQlTf6-aZLVwDAMHMYeBSw0liU823QMh4VU50IY0HjHXppxH3OIA88p2Dhs_cRD5EOyu83Ef0PejPvMDz5lf-QUpu8xxMxHIt6duvP4ns16u538wy3nbP32um4-itXX-2ezXBW2qrGgrlKIgEILZw3I3oIqyUkkp2vSNUjRawlgUPbSGkFYVSS988Zo50iqOXu63l4E7S6FH5tO7b-kvUjUHwg4Q5Y</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Counting triangles in graphs without vertex disjoint odd cycles</title><source>arXiv.org</source><creator>Hou, Jianfeng ; Yang, Caihong ; Zeng, Qinghou</creator><creatorcontrib>Hou, Jianfeng ; Yang, Caihong ; Zeng, Qinghou</creatorcontrib><description>Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in
an $F$-free graph on $n$ vertices is denoted by $\mathrm{ex}(n, H, F)$. Let
$(\ell+1) \cdot F$ denote $\ell+1$ vertex disjoint copies of $F$. In this
paper, we determine the exact value of $\mathrm{ex}(n, C_3, (\ell+1)\cdot
C_{2k+1})$ and its extremal graph, which generalizes some known results.</description><identifier>DOI: 10.48550/arxiv.2310.19048</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2023-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2310.19048$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2310.19048$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Hou, Jianfeng</creatorcontrib><creatorcontrib>Yang, Caihong</creatorcontrib><creatorcontrib>Zeng, Qinghou</creatorcontrib><title>Counting triangles in graphs without vertex disjoint odd cycles</title><description>Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in
an $F$-free graph on $n$ vertices is denoted by $\mathrm{ex}(n, H, F)$. Let
$(\ell+1) \cdot F$ denote $\ell+1$ vertex disjoint copies of $F$. In this
paper, we determine the exact value of $\mathrm{ex}(n, C_3, (\ell+1)\cdot
C_{2k+1})$ and its extremal graph, which generalizes some known results.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz8tqwzAUBFBtsihpP6Cr6gecXj1sX61KMH1BoJvsjeQrOyqpHGQlTf6-aZLVwDAMHMYeBSw0liU823QMh4VU50IY0HjHXppxH3OIA88p2Dhs_cRD5EOyu83Ef0PejPvMDz5lf-QUpu8xxMxHIt6duvP4ns16u538wy3nbP32um4-itXX-2ezXBW2qrGgrlKIgEILZw3I3oIqyUkkp2vSNUjRawlgUPbSGkFYVSS988Zo50iqOXu63l4E7S6FH5tO7b-kvUjUHwg4Q5Y</recordid><startdate>20231029</startdate><enddate>20231029</enddate><creator>Hou, Jianfeng</creator><creator>Yang, Caihong</creator><creator>Zeng, Qinghou</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20231029</creationdate><title>Counting triangles in graphs without vertex disjoint odd cycles</title><author>Hou, Jianfeng ; Yang, Caihong ; Zeng, Qinghou</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-dc638808141ba902fa035db28db47d47021f4200982f2a91d866d2ebe994bbd23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Hou, Jianfeng</creatorcontrib><creatorcontrib>Yang, Caihong</creatorcontrib><creatorcontrib>Zeng, Qinghou</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hou, Jianfeng</au><au>Yang, Caihong</au><au>Zeng, Qinghou</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Counting triangles in graphs without vertex disjoint odd cycles</atitle><date>2023-10-29</date><risdate>2023</risdate><abstract>Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in
an $F$-free graph on $n$ vertices is denoted by $\mathrm{ex}(n, H, F)$. Let
$(\ell+1) \cdot F$ denote $\ell+1$ vertex disjoint copies of $F$. In this
paper, we determine the exact value of $\mathrm{ex}(n, C_3, (\ell+1)\cdot
C_{2k+1})$ and its extremal graph, which generalizes some known results.</abstract><doi>10.48550/arxiv.2310.19048</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2310.19048 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2310_19048 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | Counting triangles in graphs without vertex disjoint odd cycles |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-15T00%3A39%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Counting%20triangles%20in%20graphs%20without%20vertex%20disjoint%20odd%20cycles&rft.au=Hou,%20Jianfeng&rft.date=2023-10-29&rft_id=info:doi/10.48550/arxiv.2310.19048&rft_dat=%3Carxiv_GOX%3E2310_19048%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |