Biclique covers and partitions

zbMATH Open1300.05259arXiv1307.6363MaRDI QIDQ405095FDOQ405095

Authors: Trevor Pinto 

Publication date: 4 September 2014

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

Abstract: The biclique cover number (resp. biclique partition number) of a graph $G$, $mathrmbc(G$) (resp. $mathrmbp(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$, $mathrmlbc(G$) (resp. $mathrmlbp(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 $mathrmbp(G)$ may be bounded in terms of $mathrmbc(G)$, in particular, $mathrmbp(G)leqfrac12(3^{m}athrmbc(G)-1)$. However, the analogous result does not hold for the local measures. Indeed, in our main result, we show that $mathrmlbp(G)$ can be arbitrarily large, even for graphs with $mathrmlbc(G)=2$. For such graphs, $G$, we try to bound $mathrmlbp(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.

Full work available at URL: https://arxiv.org/abs/1307.6363

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

Recommendations

• Biclique cover and local clique cover of graphs
• Regarding two conjectures on clique and biclique partitions
• A note on \(d\)-biclique covers
• Covering graphs with few complete bipartite subgraphs
• Publication:3478420

zbMATH Keywords

biclique coversbiclique partitionslocal biclique cover numbersubcube 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)

Cites Work

• A mathematical analysis of human leukocyte antigen serology
• Topics in Intersection Graph Theory
• Graph Theory and Probability
• On the Addressing Problem for Loop Switching
• Title not available (Why is that?)
• Communication Complexity
• Covering a graph by complete bipartite graphs
• On set intersection representations of graphs
• Turán and Ramsey Properties of Subcube Intersection Graphs
• Title not available (Why is that?)
• On the decomposition ofkn into complete bipartite graphs
• On covering graphs by complete bipartite subgraphs
• Bipartite dimensions and bipartite degrees of graphs
• On the coverings of graphs
• Bipartite coverings and the chromatic number
• Title not available (Why is that?)
• Bipartite Coverings of Graphs
• Title not available (Why is that?)
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• On the decomposition of graphs into complete bipartite graphs

Cited In (14)

• An overview of graph covering and partitioning
• Title not available (Why is that?)
• Biclique cover and local clique cover of graphs
• The biclique covering number of grids
• Regarding two conjectures on clique and biclique partitions
• Fractional biclique covers and partitions of graphs
• Coherent network partitions: characterizations with cographs and prime graphs
• Finding biclique partitions of co-chordal graphs
• Coherent network partitions
• Random subcube intersection graphs. I: Cliques and covering
• Title not available (Why is that?)
• Erdős-Pyber theorem for hypergraphs and secret sharing
• Three ways to cover a graph
• Edge clique covering sum of graphs

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)