New answers tagged infinite-combinatorics
8
votes
Accepted
Uniformization of almost disjoint families
No, this is not consistent: there is (provably in ZFC) an almost disjoint family of size $\aleph_1$ and a two-valued function on that family such that the function cannot be uniformized in the way you'...
4
votes
Accepted
Does $\mathbb{Z}\times\mathbb{Z}$ have an aperiodic monotile?
Yes. A $2$-by-$2$ square $\{0,1\}^2$ can tile $\mathbb{Z}^2$ with just one period. So $\{0,2\}^2$ can tile $2\mathbb{Z}^2 \leq \mathbb{Z}^2$ with just one period. Break other periods in the other ...
2
votes
Accepted
Is the chromatic number of hypergraphs downward continuous?
Fred Galvin had conjectured that the answer is "yes" for graphs in [1] (conjecture 2), in his paper he showed that the variation of the problem to induced graphs is consistently false: ...
1
vote
Accepted
Order-embeddability of ${\frak b}$ and ${\frak d}$ in $\mathbb{R}$
Assume that $i : \alpha \to \mathbb{R}$ is an order-embedding of some ordinal $\alpha$ into $(\mathbb{R},<)$. We can modify $i$ to yield an order embedding $j : \alpha \to \mathbb{Q}$ by induction ...
Top 50 recent answers are included
Related Tags
infinite-combinatorics × 437set-theory × 278
co.combinatorics × 102
graph-theory × 95
hypergraph × 72
lo.logic × 64
graph-colorings × 35
forcing × 34
gn.general-topology × 21
gr.group-theory × 17
order-theory × 16
large-cardinals × 15
matching-theory × 15
ultrafilters × 14
ramsey-theory × 14
cardinal-characteristics × 13
descriptive-set-theory × 12
posets × 12
nt.number-theory × 11
covering × 11
reference-request × 10
measure-theory × 8
axiom-of-choice × 7
partitions × 7
sequences-and-series × 6