Biholes in balanced bipartite graphs
Combinatorics
2020-04-13 v2
Abstract
A bihole in a bipartite graph with partite sets and is an independent set in with . 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.
Keywords
Cite
@article{arxiv.2004.03245,
title = {Biholes in balanced bipartite graphs},
author = {Stefan Ehard and Elena Mohr and Dieter Rautenbach},
journal= {arXiv preprint arXiv:2004.03245},
year = {2020}
}