On biclique coverings (Q2468013): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Dalibor Fronček / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
| Property / author | |||
| Property / author: Dalibor Fronček / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038455086 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the coverings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering a graph with cuts of minimum total size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal completely separating systems / rank | |||
Normal rank | |||
Latest revision as of 15:07, 27 June 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
