Biclique covers and partitions

Publication date 4 September 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.6363, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p19

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

biclique covers biclique partitions local biclique cover number subcube intersection graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05)

Abstract: The biclique cover number (resp. biclique partition number) of a graph

G

,

m a t h r m b c (G

) (resp.

m a t h r m b p (G)

), is the least number of biclique (complete bipartite) subgraphs that are needed to cover (resp. partition) the edges of

G

. The emph{local biclique cover number} (resp. local biclique partition number) of a graph

G

,

m a t h r m l b c (G

) (resp.

m a t h r m l b p (G)

), is the least

r

such that there is a cover (resp. partition) of the edges of

G

by bicliques with no vertex in more than

r

of these bicliques. We show that

m a t h r m b p (G)

may be bounded in terms of

m a t h r m b c (G)

, in particular,

m a t h r m b p (G) l e q f r a c 12 (3^{m} a t h r m b c (G) - 1)

. However, the analogous result does not hold for the local measures. Indeed, in our main result, we show that

m a t h r m l b p (G)

can be arbitrarily large, even for graphs with

m a t h r m l b c (G) = 2

. For such graphs,

G

, we try to bound

m a t h r m l b p (G)

in terms of additional information about biclique covers of

G

. We both answer and leave open questions related to this. There is a well known link between biclique covers and subcube intersection graphs. We consider the problem of finding the least

r (n)

for which every graph on

n

vertices can be represented as a subcube intersection graph in which every subcube has dimension

r

. We reduce this problem to the much studied question of finding the least

d (n)

such that every graph on

n

vertices is the intersection graph of subcubes of a

d

-dimensional cube.

Review text

Summary: The biclique cover number (resp. biclique partition number) of a graph \(G\), \(\text{bc}(G\)) (resp. \(\text{bp}(G)\)), is the least number of bicliques -- complete bipartite subgraphs -- that are needed to cover (resp. partition) the edges of \(G\). { }The local biclique cover number (resp. local biclique partition number) of a graph \(G\), \(\text{lbc}(G\)) (resp. \(\text{lbp}(G)\)), is the least \(r\) such that there is a cover (resp. partition) of the edges of \(G\) by bicliques with no vertex in more than \(r\) of these bicliques.{ }We show that \(\text{bp}(G)\) may be bounded in terms of \(\text{bc}(G)\), in particular, \(\text{bp}(G)\leq \frac{1}{2}(3^{\text{bc(G)}}-1)\). However, the analogous result does not hold for the local measures. Indeed, in our main result, we show that \(\text{lbp}(G)\) can be arbitrarily large, even for graphs with \(\text{lbc}(G)=2\). For such graphs, \(G\), we try to bound \(\text{lbp}(G)\) in terms of additional information about biclique covers of \(G\). We both answer and leave open questions related to this.{ }There is a well known link between biclique covers and subcube intersection graphs. We consider the problem of finding the least \(r(n)\) for which every graph on \(n\) vertices can be represented as a subcube intersection graph in which every subcube has dimension \(r\). We reduce this problem to the much studied question of finding the least \(d(n)\) such that every graph on \(n\) vertices is the intersection graph of subcubes of a \(d\)-dimensional cube.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Biclique covers and partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405095)