Sunday, October 06, 2013

[jhltvqdf] Integers to unlabeled graphs

Create a bijection between non-negative integers and unlabeled, undirected graphs.

This is mostly a problem in search of an application, but it is intriguing that arbitrary information may be encoded in the connections between things rather than their individual identities.  Perhaps steganography.

Same question for trees of various types.

No comments :