On disjoint matchings in cubic graphs
For \(i=2,3\) and a cubic graph \(G\) let \(\nu_{i}(G)\) denote the maximum number of edges that can be covered by \(i\) matchings. We show that \(\nu_{2}(G)\geq {4/5}| V(G)| \) and \(\nu_{3}(G)\geq {7/6}| V(G)| \). Moreover, it turns out that \(\nu_{2}(G)\leq \frac{|V(G)|+2\nu_{3}(G)}{4}\).
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2010-02 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Mkrtchyan, Vahan V Petrosyan, Samvel S Vardanyan, Gagik N |
| description | For \(i=2,3\) and a cubic graph \(G\) let \(\nu_{i}(G)\) denote the maximum number of edges that can be covered by \(i\) matchings. We show that \(\nu_{2}(G)\geq {4/5}| V(G)| \) and \(\nu_{3}(G)\geq {7/6}| V(G)| \). Moreover, it turns out that \(\nu_{2}(G)\leq \frac{|V(G)|+2\nu_{3}(G)}{4}\). |
| doi_str_mv | 10.48550/arxiv.0803.0134 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0803_0134</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2087537510</sourcerecordid><originalsourceid>FETCH-LOGICAL-a510-4887d0bb276430102a12f439b4a27571d1aa52c0bd51efafaa505e8ca89ca0a33</originalsourceid><addsrcrecordid>eNotj0FLw0AQhRdBsNTePUlAPCbOzux2t0cpaoVCL72HySZpN9gk7iai_97Ueno8eDy-T4g7CZmyWsMTh2__lYEFykCSuhIzJJKpVYg3YhFjAwC4NKg1zcTjrk1KH5vOt0Ny4sEdfXuIiW8TNxbeJYfA_THeiuuaP2K1-M-52L--7NebdLt7e18_b1PWElJlrSmhKNAsFYEEZIm1olWhGI02spTMGh0UpZZVzfXUQFfWsV05Biaai_vL7Z9C3gd_4vCTn1Xys8o0eLgM-tB9jlUc8qYbQzsh5QjWaDITB_0C_5RJ7Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2087537510</pqid></control><display><type>article</type><title>On disjoint matchings in cubic graphs</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Mkrtchyan, Vahan V ; Petrosyan, Samvel S ; Vardanyan, Gagik N</creator><creatorcontrib>Mkrtchyan, Vahan V ; Petrosyan, Samvel S ; Vardanyan, Gagik N</creatorcontrib><description>For \(i=2,3\) and a cubic graph \(G\) let \(\nu_{i}(G)\) denote the maximum number of edges that can be covered by \(i\) matchings. We show that \(\nu_{2}(G)\geq {4/5}| V(G)| \) and \(\nu_{3}(G)\geq {7/6}| V(G)| \). Moreover, it turns out that \(\nu_{2}(G)\leq \frac{|V(G)|+2\nu_{3}(G)}{4}\).</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0803.0134</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Discrete Mathematics ; Graph theory</subject><ispartof>arXiv.org, 2010-02</ispartof><rights>2010. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><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,780,881,27904</link.rule.ids><backlink>$$Uhttps://doi.org/10.1016/j.disc.2010.02.007$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.0803.0134$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Mkrtchyan, Vahan V</creatorcontrib><creatorcontrib>Petrosyan, Samvel S</creatorcontrib><creatorcontrib>Vardanyan, Gagik N</creatorcontrib><title>On disjoint matchings in cubic graphs</title><title>arXiv.org</title><description>For \(i=2,3\) and a cubic graph \(G\) let \(\nu_{i}(G)\) denote the maximum number of edges that can be covered by \(i\) matchings. We show that \(\nu_{2}(G)\geq {4/5}| V(G)| \) and \(\nu_{3}(G)\geq {7/6}| V(G)| \). Moreover, it turns out that \(\nu_{2}(G)\leq \frac{|V(G)|+2\nu_{3}(G)}{4}\).</description><subject>Computer Science - Discrete Mathematics</subject><subject>Graph theory</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj0FLw0AQhRdBsNTePUlAPCbOzux2t0cpaoVCL72HySZpN9gk7iai_97Ueno8eDy-T4g7CZmyWsMTh2__lYEFykCSuhIzJJKpVYg3YhFjAwC4NKg1zcTjrk1KH5vOt0Ny4sEdfXuIiW8TNxbeJYfA_THeiuuaP2K1-M-52L--7NebdLt7e18_b1PWElJlrSmhKNAsFYEEZIm1olWhGI02spTMGh0UpZZVzfXUQFfWsV05Biaai_vL7Z9C3gd_4vCTn1Xys8o0eLgM-tB9jlUc8qYbQzsh5QjWaDITB_0C_5RJ7Q</recordid><startdate>20100225</startdate><enddate>20100225</enddate><creator>Mkrtchyan, Vahan V</creator><creator>Petrosyan, Samvel S</creator><creator>Vardanyan, Gagik N</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20100225</creationdate><title>On disjoint matchings in cubic graphs</title><author>Mkrtchyan, Vahan V ; Petrosyan, Samvel S ; Vardanyan, Gagik N</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a510-4887d0bb276430102a12f439b4a27571d1aa52c0bd51efafaa505e8ca89ca0a33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Computer Science - Discrete Mathematics</topic><topic>Graph theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Mkrtchyan, Vahan V</creatorcontrib><creatorcontrib>Petrosyan, Samvel S</creatorcontrib><creatorcontrib>Vardanyan, Gagik N</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mkrtchyan, Vahan V</au><au>Petrosyan, Samvel S</au><au>Vardanyan, Gagik N</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On disjoint matchings in cubic graphs</atitle><jtitle>arXiv.org</jtitle><date>2010-02-25</date><risdate>2010</risdate><eissn>2331-8422</eissn><abstract>For \(i=2,3\) and a cubic graph \(G\) let \(\nu_{i}(G)\) denote the maximum number of edges that can be covered by \(i\) matchings. We show that \(\nu_{2}(G)\geq {4/5}| V(G)| \) and \(\nu_{3}(G)\geq {7/6}| V(G)| \). Moreover, it turns out that \(\nu_{2}(G)\leq \frac{|V(G)|+2\nu_{3}(G)}{4}\).</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0803.0134</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2010-02 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_0803_0134 |
| source | arXiv.org; Free E- Journals |
| subjects | Computer Science - Discrete Mathematics Graph theory |
| title | On disjoint matchings in cubic graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T19%3A17%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20disjoint%20matchings%20in%20cubic%20graphs&rft.jtitle=arXiv.org&rft.au=Mkrtchyan,%20Vahan%20V&rft.date=2010-02-25&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0803.0134&rft_dat=%3Cproquest_arxiv%3E2087537510%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2087537510&rft_id=info:pmid/&rfr_iscdi=true |