Co-degrees resilience for perfect matchings in random hypergraphs

Co-degrees resilience for perfect matchings in random hypergraphs

In this paper we prove an optimal co-degrees resilience property for the binomial \(k\)-uniform hypergraph model \(H_{n,p}^k\) with respect to perfect matchings. That is, for a sufficiently large \(n\) which is divisible by \(k\), and \(p\geq C_k\log_n/n\), we prove that with high probability every...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2020-02
Hauptverfasser: Ferber, Asaf, Hirschfeld, Lior
Format: Artikel
Sprache:eng
Schlagworte:
Graph theory
Mathematics - Combinatorics
Resilience
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 Ferber, Asaf
Hirschfeld, Lior
description In this paper we prove an optimal co-degrees resilience property for the binomial \(k\)-uniform hypergraph model \(H_{n,p}^k\) with respect to perfect matchings. That is, for a sufficiently large \(n\) which is divisible by \(k\), and \(p\geq C_k\log_n/n\), we prove that with high probability every subgraph \(H\subseteq H^k_{n,p}\) with minimum co-degree (meaning, the number of supersets every set of size \(k-1\) is contained in) at least \((1/2+o(1))np\) contains a perfect matching.
doi_str_mv 10.48550/arxiv.1908.01435
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1908_01435</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2268880086</sourcerecordid><originalsourceid>FETCH-LOGICAL-a526-9b1f4d1823dbd35517ed27bdda5da41f525c5d6c3603ae7e9e2001a4e4a714813</originalsourceid><addsrcrecordid>eNotj8tqwzAUREWh0JDmA7qqoGu7elteBtMXBLrJ3lxb17ZC_KjklObv6yZdzWIOwxxCHjhLldWaPUP48d8pz5lNGVdS35CVkJInVglxRzYxHhhjwmRCa7ki22JMHLYBMdKA0R89DjXSZgx0wtBgPdMe5rrzQxupH2iAwY097c5L2waYunhPbhs4Rtz855rsX1_2xXuy-3z7KLa7BLQwSV7xRjluhXSVk1rzDJ3IKudAO1C80ULX2plaGiYBM8xRMMZBoYKMK8vlmjxeZy9-5RR8D-Fc_nmWF8-FeLoSUxi_Thjn8jCewrB8KoUw1lrGrJG_oCZVfA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2268880086</pqid></control><display><type>article</type><title>Co-degrees resilience for perfect matchings in random hypergraphs</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Ferber, Asaf ; Hirschfeld, Lior</creator><creatorcontrib>Ferber, Asaf ; Hirschfeld, Lior</creatorcontrib><description>In this paper we prove an optimal co-degrees resilience property for the binomial \(k\)-uniform hypergraph model \(H_{n,p}^k\) with respect to perfect matchings. That is, for a sufficiently large \(n\) which is divisible by \(k\), and \(p\geq C_k\log_n/n\), we prove that with high probability every subgraph \(H\subseteq H^k_{n,p}\) with minimum co-degree (meaning, the number of supersets every set of size \(k-1\) is contained in) at least \((1/2+o(1))np\) contains a perfect matching.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1908.01435</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Graph theory ; Mathematics - Combinatorics ; Resilience</subject><ispartof>arXiv.org, 2020-02</ispartof><rights>2020. 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,780,784,885,27924</link.rule.ids><backlink>$$Uhttps://doi.org/10.37236/8167$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1908.01435$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ferber, Asaf</creatorcontrib><creatorcontrib>Hirschfeld, Lior</creatorcontrib><title>Co-degrees resilience for perfect matchings in random hypergraphs</title><title>arXiv.org</title><description>In this paper we prove an optimal co-degrees resilience property for the binomial \(k\)-uniform hypergraph model \(H_{n,p}^k\) with respect to perfect matchings. That is, for a sufficiently large \(n\) which is divisible by \(k\), and \(p\geq C_k\log_n/n\), we prove that with high probability every subgraph \(H\subseteq H^k_{n,p}\) with minimum co-degree (meaning, the number of supersets every set of size \(k-1\) is contained in) at least \((1/2+o(1))np\) contains a perfect matching.</description><subject>Graph theory</subject><subject>Mathematics - Combinatorics</subject><subject>Resilience</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</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>eNotj8tqwzAUREWh0JDmA7qqoGu7elteBtMXBLrJ3lxb17ZC_KjklObv6yZdzWIOwxxCHjhLldWaPUP48d8pz5lNGVdS35CVkJInVglxRzYxHhhjwmRCa7ki22JMHLYBMdKA0R89DjXSZgx0wtBgPdMe5rrzQxupH2iAwY097c5L2waYunhPbhs4Rtz855rsX1_2xXuy-3z7KLa7BLQwSV7xRjluhXSVk1rzDJ3IKudAO1C80ULX2plaGiYBM8xRMMZBoYKMK8vlmjxeZy9-5RR8D-Fc_nmWF8-FeLoSUxi_Thjn8jCewrB8KoUw1lrGrJG_oCZVfA</recordid><startdate>20200207</startdate><enddate>20200207</enddate><creator>Ferber, Asaf</creator><creator>Hirschfeld, Lior</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>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200207</creationdate><title>Co-degrees resilience for perfect matchings in random hypergraphs</title><author>Ferber, Asaf ; Hirschfeld, Lior</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a526-9b1f4d1823dbd35517ed27bdda5da41f525c5d6c3603ae7e9e2001a4e4a714813</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Graph theory</topic><topic>Mathematics - Combinatorics</topic><topic>Resilience</topic><toplevel>online_resources</toplevel><creatorcontrib>Ferber, Asaf</creatorcontrib><creatorcontrib>Hirschfeld, Lior</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; 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 (ProQuest)</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 Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ferber, Asaf</au><au>Hirschfeld, Lior</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Co-degrees resilience for perfect matchings in random hypergraphs</atitle><jtitle>arXiv.org</jtitle><date>2020-02-07</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>In this paper we prove an optimal co-degrees resilience property for the binomial \(k\)-uniform hypergraph model \(H_{n,p}^k\) with respect to perfect matchings. That is, for a sufficiently large \(n\) which is divisible by \(k\), and \(p\geq C_k\log_n/n\), we prove that with high probability every subgraph \(H\subseteq H^k_{n,p}\) with minimum co-degree (meaning, the number of supersets every set of size \(k-1\) is contained in) at least \((1/2+o(1))np\) contains a perfect matching.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1908.01435</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2020-02
issn 2331-8422
language eng
recordid cdi_arxiv_primary_1908_01435
source arXiv.org; Free E- Journals
subjects Graph theory
Mathematics - Combinatorics
Resilience
title Co-degrees resilience for perfect matchings in random hypergraphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T08%3A27%3A26IST&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=Co-degrees%20resilience%20for%20perfect%20matchings%20in%20random%20hypergraphs&rft.jtitle=arXiv.org&rft.au=Ferber,%20Asaf&rft.date=2020-02-07&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1908.01435&rft_dat=%3Cproquest_arxiv%3E2268880086%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=2268880086&rft_id=info:pmid/&rfr_iscdi=true