On biclique coverings (Q2468013): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:17, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On biclique coverings |
scientific article |
Statements
On biclique coverings (English)
0 references
30 January 2008
0 references
The second author showed that if the edge set of the complete bipartite graph \(K_{n,n}\) with a matching removed can be covered by \(k\) complete bipartite graphs then \(n\leq \binom {k}{\frac {k}{2}}\). In this paper a simpler proof is provided and it it shown that the bound is tight.
0 references
graph coverings
0 references
bicliques
0 references
Sperner's theorem
0 references
graph composition
0 references
lexicographic product
0 references
