## New answers tagged infinite-combinatorics

4
votes

Accepted

### Cardinality of splitting families

For any set $X$ let $\operatorname{SF}(X)$ be the the set of all families $\mathcal S\subseteq\mathcal P(X)$ such that, for each pair $\{x,y\}\in[X]^2$, there is a set $A\in\mathcal S$ with $|A\cap\{x,...

8
votes

### Does every linear cover contain a minimal cover?

Partial answer. I show that a minimal subcover exists in two special cases, namely, if $\mathcal C$ consists of $2$-element sets, or if $X$ is countable.
Theorem 1. A cover consisting of $2$-element ...

7
votes

Accepted

### (Weakly) minimal subcovers of linear covers

The answer is yes. I will prove the contrapositive. Suppose $\mathcal C$ is a cover of a nonempty set $X$ with no weakly minimal subcover; I claim that $\mathcal C$ is nonlinear. (In fact there is an ...

9
votes

### Balancing act for infinite walks

The limit of the following sequences probably works:
$A_0 = \varepsilon$
$A_i = (A_{i-1}0)^{2^{(i^2)}}A_{i-1}(1A_{i-1})^{2^{(i^2)}}$
Intuition: For every $S$, there exists some $A_i$ which is not a ...

Top 50 recent answers are included

#### Related Tags

infinite-combinatorics × 485set-theory × 307

co.combinatorics × 118

graph-theory × 103

hypergraph × 82

lo.logic × 76

graph-colorings × 41

forcing × 35

gn.general-topology × 22

gr.group-theory × 20

order-theory × 17

large-cardinals × 16

ultrafilters × 15

matching-theory × 15

ramsey-theory × 14

cardinal-characteristics × 14

nt.number-theory × 13

covering × 13

reference-request × 12

descriptive-set-theory × 12

posets × 12

measure-theory × 11

partitions × 10

axiom-of-choice × 9

sequences-and-series × 7