On a problem of Zaks

DOI10.1006/JCTA.2000.3083MaRDI QIDQ5930028zbMATH OpenOpenAlexFDO

Authors Alan J. Hoffman

Publication date 27 August 2001

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcta.2000.3083

zbMATH Keywords

complete bipartite graphmatchingpartitionZaks graph

Mathematics Subject Classification ID

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

Review text

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\).

Recommendations

• Publication:4722520
• scientific article; zbMATH DE number 4198026
• scientific article; zbMATH DE number 3311770
• scientific article; zbMATH DE number 3273328
• On a problem of Zygmund
• scientific article; zbMATH DE number 3135232
• On a problem of B. Zelinka
• scientific article; zbMATH DE number 4107003
• scientific article; zbMATH DE number 59759
• scientific article; zbMATH DE number 24791

Cites work

• Eigenvalues and partitionings of the edges of a graph
• Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
• On the Addressing Problem for Loop Switching

Cited in

(2)

• scientific article; zbMATH DE number 2154963 (Why is no real title available?)
• Binary stretch embedding of weighted graphs

This page was built for publication: On a problem of Zaks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930028)