On covering graphs by complete bipartite subgraphs

We prove that, if a graph with e edges contains m vertex-disjoint edges, then m 2 / e complete bipartite subgraphs are necessary to cover all its edges. Similar lower bounds are also proved for fractional covers. For sparse graphs, this improves the well-known fooling set lower bound in communicatio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics Jg. 309; H. 10; S. 3399 - 3403
Hauptverfasser: Jukna, S., Kulikov, A.S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 28.05.2009
Schlagworte:
Biclique
Boolean functions
Communication complexity
Edge clique covering number
Fractional covers
Boolean functions
Communication complexity
Edge clique covering number
Fractional covers
Biclique
ISSN:0012-365X, 1872-681X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that, if a graph with e edges contains m vertex-disjoint edges, then m 2 / e complete bipartite subgraphs are necessary to cover all its edges. Similar lower bounds are also proved for fractional covers. For sparse graphs, this improves the well-known fooling set lower bound in communication complexity. We also formulate several open problems about covering problems for graphs whose solution would have important consequences in the complexity theory of boolean functions.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2008.09.036