Biholes in balanced bipartite graphs

Biholes in balanced bipartite graphs

A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ in $G$ with $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes in balanced bipartite graphs subject to conditions involving the vertex degrees and the average degree.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ehard, Stefan, Mohr, Elena, Rautenbach, Dieter
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
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 Ehard, Stefan
Mohr, Elena
Rautenbach, Dieter
description A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ in $G$ with $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes in balanced bipartite graphs subject to conditions involving the vertex degrees and the average degree.
doi_str_mv 10.48550/arxiv.2004.03245
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2004_03245</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2004_03245</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-2d07be38dd8bd605ad36eba0fba4069cf50dd5520b5a3af99d353279ab1d2bb23</originalsourceid><addsrcrecordid>eNotzrsKwkAQQNFtLET9ACtT2CaOu5k8ShVfINjYhxlnYxZiDBsR_XvxUd3ucpQazyGKM0SYkX-6R6QB4giMjrGvpktX3WrbBa4JmGpqzlYCdi35u7vb4OKprbqh6pVUd3b070CdNuvTahcejtv9anEIKUkx1AIpW5OJZCwJIIlJLBOUTDEk-blEEEHUwEiGyjwXg0anOfFcNLM2AzX5bb_MovXuSv5VfLjFl2ve3qY5-w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Biholes in balanced bipartite graphs</title><source>arXiv.org</source><creator>Ehard, Stefan ; Mohr, Elena ; Rautenbach, Dieter</creator><creatorcontrib>Ehard, Stefan ; Mohr, Elena ; Rautenbach, Dieter</creatorcontrib><description>A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ in $G$ with $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes in balanced bipartite graphs subject to conditions involving the vertex degrees and the average degree.</description><identifier>DOI: 10.48550/arxiv.2004.03245</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2020-04</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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2004.03245$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2004.03245$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ehard, Stefan</creatorcontrib><creatorcontrib>Mohr, Elena</creatorcontrib><creatorcontrib>Rautenbach, Dieter</creatorcontrib><title>Biholes in balanced bipartite graphs</title><description>A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ in $G$ with $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes in balanced bipartite graphs subject to conditions involving the vertex degrees and the average degree.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwkAQQNFtLET9ACtT2CaOu5k8ShVfINjYhxlnYxZiDBsR_XvxUd3ucpQazyGKM0SYkX-6R6QB4giMjrGvpktX3WrbBa4JmGpqzlYCdi35u7vb4OKprbqh6pVUd3b070CdNuvTahcejtv9anEIKUkx1AIpW5OJZCwJIIlJLBOUTDEk-blEEEHUwEiGyjwXg0anOfFcNLM2AzX5bb_MovXuSv5VfLjFl2ve3qY5-w</recordid><startdate>20200407</startdate><enddate>20200407</enddate><creator>Ehard, Stefan</creator><creator>Mohr, Elena</creator><creator>Rautenbach, Dieter</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200407</creationdate><title>Biholes in balanced bipartite graphs</title><author>Ehard, Stefan ; Mohr, Elena ; Rautenbach, Dieter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-2d07be38dd8bd605ad36eba0fba4069cf50dd5520b5a3af99d353279ab1d2bb23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Ehard, Stefan</creatorcontrib><creatorcontrib>Mohr, Elena</creatorcontrib><creatorcontrib>Rautenbach, Dieter</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ehard, Stefan</au><au>Mohr, Elena</au><au>Rautenbach, Dieter</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Biholes in balanced bipartite graphs</atitle><date>2020-04-07</date><risdate>2020</risdate><abstract>A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ in $G$ with $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes in balanced bipartite graphs subject to conditions involving the vertex degrees and the average degree.</abstract><doi>10.48550/arxiv.2004.03245</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2004.03245
ispartof
issn
language eng
recordid cdi_arxiv_primary_2004_03245
source arXiv.org
subjects Mathematics - Combinatorics
title Biholes in balanced bipartite 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-07T13%3A21%3A55IST&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=Biholes%20in%20balanced%20bipartite%20graphs&rft.au=Ehard,%20Stefan&rft.date=2020-04-07&rft_id=info:doi/10.48550/arxiv.2004.03245&rft_dat=%3Carxiv_GOX%3E2004_03245%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