Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 1d, printed p. 152 (published PDF).

Statement. Let J1,…,JkJ_1,\ldots,J_k be pairwise disjoint independent sets of a finite matroid M=(E,F)M=(E,\mathcal F), with k≥1k\ge1, and put E′=E∖⋃iJiE'=E\setminus\bigcup_iJ_i. There is an indexed partition into independent sets IiI_i such that Ji⊆IiJ_i\subseteq I_i if and only if

∣A∣≤∑i=1k(r(A∪Ji)−r(Ji))(A⊆E′).(1)|A|\le\sum_{i=1}^k\bigl(r(A\cup J_i)-r(J_i)\bigr) \qquad(A\subseteq E'). \tag{1}

Proof. For each ii, contract the independent seed JiJ_i and restrict the resulting matroid to E′E'. By the contraction formula, the resulting matroid MiM_i has rank

ri(A)=r(A∪Ji)−r(Ji)(A⊆E′).r_i(A)=r(A\cup J_i)-r(J_i)\qquad(A\subseteq E').

Its independent subsets K⊆E′K\subseteq E' are precisely those for which K∪JiK\cup J_i is independent in MM.

An independent partition (Ii)(I_i) extending the seeds gives a partition Ki=Ii∖JiK_i=I_i\setminus J_i of E′E' into independent sets of the respective MiM_i: disjointness of the IiI_i prevents a part from containing any other seed. Conversely such a partition (Ki)(K_i) gives Ii=Ki∪JiI_i=K_i\cup J_i, a disjoint independent cover of EE, because the seeds are pairwise disjoint.

Theorem 1c applied on the common ground set E′E' now gives exactly (1). This argument includes empty seeds and E′=∅E'=\varnothing. □\square