Roberto Demontis

From MaRDI portal
Person:4621296



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
What is the least number of moves needed to solve the \(k\)-peg Tower of Hanoi problem?
Discrete Mathematics, Algorithms and Applications
2019-02-11Paper
The union-closed set conjecture is true
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Roberto Demontis