On biclique coverings (Q2468013)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5231026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On biclique coverings |
scientific article; zbMATH DE number 5231026 |
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
0.8317916989326477
0 references
0.8313732147216797
0 references
0.8234163522720337
0 references
0.8232740163803101
0 references
