Stefan Ehard, Elena Mohr, Dieter Rautenbach
Abstract
Open-access reader
A bihole in a bipartite graph G with partite sets A and B is an independent set I in G with |I ∩ A| = |I ∩ 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.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A bihole in a bipartite graph G with partite sets A and B is an independent set I in G with |I ∩ A| = |I ∩ 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.
Key concepts: Bipartite graph, Combinatorics, Mathematics, Vertex (graph theory), Graph, Complete bipartite graph, Discrete mathematics, Independent set