Nikolai Beluhov

collaborators

2 papers

math.CO2023

Slitherlink Signatures

Nikolai Beluhov

Let $G$ be a planar graph and let $C$ be a cycle in $G$ . Inside of each finite face of $G$ , we write down the number of edges of that face which belong to $C$ . This is the signatur…

math.CO2016

Renyi-Ulam Games and Forbidden Substrings

Nikolai Beluhov

The Renyi-Ulam game is played between two players, the Seeker and the Obscurer. The Obscurer thinks of a number between 1 and $n$ . The Seeker wishes to identify that number. On eac…