Computability of Countable Sunflowers

Nathanael Ackerman, Leah Karker, Mostafa Mirabi

We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to…