Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem

DOI10.1016/j.disc.2016.09.034zbMath1369.05018OpenAlexW2549344605MaRDI QIDQ2400576

Dai-Yang Wu, Te-Sheng Tan, Wing-Kai Hon

Publication date: 29 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.034

zbMATH Keywords

combinatorial optimizationinteger partitioncoin weighingmaximal partition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Related Items (1)

Disjoint cycles of different lengths in 3-regular digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Searching for counterfeit coins
• How to find many counterfeit coins?
• A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem
• The general counterfeit coin problem
• Lower Bounds for Coin-Weighing Problems
• Coin-Weighing Problems

This page was built for publication: Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem