All Questions
1 question
4
votes
1
answer
159
views
Are two "perfectly dense" hypergraphs on $\mathbb{N}$ necessarily isomorphic?
We say that a hypergraph $(\mathbb{N}, E)$ where $E\subseteq {\cal P}(\mathbb N)$ is perfectly dense if
$\mathbb{N}\notin E$,
all $e\in E$ are infinite,
$e_1, e_2 \in E$ implies $|e_1\cap e_2| = 1$,...
- 48.9k