Covering a graph by complete bipartite graphs

DOI10.1016/S0012-365X(96)00124-0zbMath0876.05080OpenAlexW2049398763WikidataQ104010005 ScholiaQ104010005MaRDI QIDQ1363672

Paul Erdős, László Pyber

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00124-0

zbMATH Keywords

partitioncoveringscomplete bipartite graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (21)

Secret-sharing schemes for very dense graphs ⋮ Secret sharing on large girth graphs ⋮ An overview of graph covering and partitioning ⋮ Local Clique Covering of Claw-Free Graphs ⋮ Local boxicity and maximum degree ⋮ Biclique covers and partitions ⋮ On the biclique cover of the complete graph ⋮ Edge clique covering sum of graphs ⋮ On-line secret sharing ⋮ Biclique cover and local clique cover of graphs ⋮ Erdős-Pyber theorem for hypergraphs and secret sharing ⋮ On difference graphs and the local dimension of posets ⋮ Some new bounds for cover-free families through biclique covers ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ Secret sharing on the \(d\)-dimensional cube ⋮ On the decomposition of graphs into complete bipartite graphs ⋮ On set intersection representations of graphs ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ On Covering Numbers, Young Diagrams, and the Local Dimension of Posets ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ Determination of the star valency of a graph

Cites Work

• On the information rate of secret sharing schemes
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Circuit coverings of graphs and a conjecture of Pyber
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering a graph by complete bipartite graphs