On a problem of Zaks (Q5930028)
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 1587284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a problem of Zaks |
scientific article; zbMATH DE number 1587284 |
Statements
On a problem of Zaks (English)
0 references
27 August 2001
0 references
Let \(M_m\) be a matching with \(m\) edges and \(n\geq 2m\) an integer. The author proves that the smallest number of complete bipartite graphs which partition the edges of \(K_n+M_m\) is at least \(n-m+\lfloor\sqrt{2m}\rfloor-1\).
0 references
Zaks graph
0 references
complete bipartite graph
0 references
matching
0 references
partition
0 references
0 references
