Erdős–Hajnal–Milner's 1968 Acta Mathematica Hungarica paper 'On sets of almost disjoint subsets of a set' (DOI 10.1007/BF01894696) founded the theory of pairwise almost-disjoint transversals of disjoint set systems. The paper leaves three threads open: (1) the paper derives, from the transversal hypothesis (existence of pairwise almost-disjoint transversals of disjoint countable sets, equivalently functions pairwise agreeing on fewer than coordinates — the functional form of the weak Kurepa hypothesis at ), a partition statement (a partition of the pairs of an -sized set into parts such that every -sized subfamily meets parts, i.e. the negative square-bracket relation ); whether conversely implies is not known. (2) The paper's stationary-set criterion for the size of almost-disjoint-transversal families has its sufficiency direction — non-stationarity of the relevant index set yields pairwise almost-disjoint transversals — proved in ZFC for every limit cardinal not cofinal with , hence including inaccessible cardinals, while the necessity direction (stationarity forces every such family to have size at most ) is proved only for singular of uncountable cofinality under a cardinal-arithmetic hypothesis; the paper explicitly asks whether a similar necessity result holds for inaccessible cardinals, and this remains open. (3) Several of its non-maximality and Cater-generalization theorems are proved only under cardinal-arithmetic hypotheses such as , , , and , and their ZFC status is unknown.
Background
Two sets are almost disjoint if the cardinality of their intersection is strictly smaller than that of either set. Given a family of pairwise disjoint nonempty sets , a transversal is a set contained in the union that meets each in exactly one element, and two transversals of the same system are almost disjoint when their intersection has cardinality below the common size of the transversals themselves (every transversal of a system of disjoint sets has size , so there this means ). Sierpiński had shown, as recounted at the outset of this theory, that disjoint sets each of size possess more than pairwise almost-disjoint transversals; Milner's contemporary paper 'Transversals of disjoint sets' (1968) poses the general question of how many pairwise almost-disjoint transversals a system of disjoint sets admits; and Erdős, Hajnal, and Milner (1968) launched the systematic theory: they proved, for example, that disjoint sets of power possess a maximal family of pairwise almost-disjoint transversals, and studied when such a family is not maximal. The hypothesis they call is the existence of pairwise almost-disjoint transversals of pairwise disjoint countably infinite sets; identifying the -th countable block , each transversal is the graph of a function , and pairwise almost disjointness says that any two of the functions agree on fewer than coordinates. This is exactly the weak Kurepa hypothesis for in the functional form studied by Kanamori (1986) and Walker (1988): there is a family (functions from to the smaller cardinal ) with for ; it is a weak relative of the Kurepa hypothesis, which asserts, at a cardinal , a family of more than subsets of whose traces on every smaller infinite subset have size at most that subset. From , Erdős–Hajnal–Milner derive a partition statement : there exists a partition of the pairs of an -sized set into parts such that every -sized subfamily has its pairs in distinct parts — a statement that had been asked separately in the partition calculus. In the standard notation this is the negative two-cardinal square-bracket relation : a coloring of the two-element subsets of with colors such that every -sized subfamily realizes all colors. The one-cardinal-level analogue was proved outright in ZFC by Todorcevic (1987) using the method of walks on ordinals (a recursive descent from one ordinal to another through a fixed sequence of closed unbounded subsets); his extensions to larger cardinals require additional principles such as non-reflecting stationary sets (stationary sets whose restriction below any smaller ordinal of uncountable cofinality is non-stationary there) or square sequences (coherent systems of closed unbounded subsets), so that literature does not settle the ZFC status of the two-cardinal statement itself. The paper also develops a criterion via stationary sets of indices (a set of ordinals is stationary in if it meets every closed unbounded subset of ): in ZFC, for every limit cardinal not cofinal with — a class that includes the inaccessible cardinals — non-stationarity of the relevant index set yields a family of pairwise almost-disjoint transversals, while, at singular and under the cardinal-arithmetic hypothesis for all , stationarity of that index set conversely forces every such family to have size at most ; the paper explicitly notes that it does not know whether a similar necessity result holds for inaccessible cardinals. Komjáth–Milner (1987) apply this criterion at cardinals , and Golshani (2019) quotes it verbatim in the equivalent language of the generalized Kurepa hypothesis at singular of uncountable cofinality. Finally, several of the paper's non-maximality theorems, and its generalization of a transversal problem posed by F. S. Cater (Problem 5370, with E. C. Milner, 1967), are proved under cardinal-arithmetic hypotheses — assumptions on exponentiation such as for all (that is, is a strong limit), , , or , where denotes the cofinality of and ranges over cardinals below — which behave differently in different models of set theory, and the paper's criteria do not unify into a single statement covering all cardinals.
Problem Statement
The Erdős–Hajnal–Milner theory of pairwise almost-disjoint transversals leaves three threads open.
Thread 1 (converse). Let be the statement that there exist pairwise almost-disjoint transversals of a system of pairwise disjoint countably infinite sets; equivalently, that there exist functions , any two of which agree on fewer than coordinates (the functional weak Kurepa hypothesis at ). Let be the statement that there exists a partition of the pairs of an -sized set into parts such that every -sized subfamily has its pairs in distinct parts (the negative square-bracket relation ), a statement that had been asked separately in the partition calculus. Erdős–Hajnal–Milner proved that implies . It is not known whether conversely implies — that is, whether this derivation of a two-cardinal negative square-bracket partition relation from a weak-Kurepa-type function family loses strength. Determine whether conversely implies . The one-cardinal analogue is a theorem of ZFC (Todorcevic 1987), but the ZFC status of itself is open: neither a ZFC proof of nor a separation of from is known.
Thread 2 (necessity at inaccessible cardinals). In the paper's setting, let be a limit cardinal with cofinality , let be the smallest ordinal of cardinality , and let be pairwise disjoint sets with and ; fix a closed increasing enumeration of cardinals cofinal in and write for the associated index set. The paper proves in ZFC (Theorem 5) that if is not cofinal with — a class that includes the inaccessible cardinals (uncountable regular limit cardinals) — and is non-stationary in , then there are pairwise almost-disjoint transversals of the ; and it proves (Theorem 6) that if is singular, for all , and is stationary, then every family of pairwise almost-disjoint transversals of the has size at most . Immediately after Theorem 6 the paper asks: 'We do not know if a similar result holds for inaccessible cardinals.' Determine whether this necessity result holds when is inaccessible: does stationarity of — alone, or under an appropriate cardinal-arithmetic hypothesis — force every family of pairwise almost-disjoint transversals to have size at most , or can this be refuted?
Thread 3 (removal of cardinal-arithmetic hypotheses). Four of the paper's theorems are proved under cardinal-arithmetic hypotheses, and the paper explicitly notes that its proofs need them:
- Theorem 4: suppose and for all (hypothesis (4)). Then any family of pairwise almost-disjoint transversals of disjoint sets () with and is non-maximal, i.e. some further transversal is almost disjoint from every member of the family. The paper states: 'We cannot prove Theorem 4 without the hypothesis (4).'
- Theorem 6: under the hypotheses of Thread 2 with singular and for all (hypothesis (6)), stationarity of forces every family of pairwise almost-disjoint transversals to have size at most .
- Theorem 7: suppose is infinite and for all with (hypothesis (11), vacuous when is regular). Then any family of pairwise almost-disjoint weak transversals of disjoint sets is non-maximal, where a weak transversal meets each set in at most one element and has size .
- Theorem 8 (the Cater generalization): assuming and for , Cater's statement holds for arbitrary , with its condition (9) replaced by the stronger condition (10): if , there is a family of more than pairwise almost-disjoint subsets of of power such that every subfamily of size has some member of the family, outside the subfamily, contained in the union of the subfamily. The paper states: 'We cannot prove this result without the g.c.h. even in the case of regular .'
Determine which of these four theorems hold in ZFC without the stated cardinal-arithmetic hypotheses. The remark that no unified criterion covering all cardinals is given is a program-level remark; the open content is the three threads above. The three threads are independent: none of them implies another.
References
- F. S. Cater, E. C. Milner (1967), 'Problem 5370', The American Mathematical Monthly 74(4), 447. DOI: 10.2307/2314598. URL: https://doi.org/10.2307/2314598
- E. C. Milner (1968), 'Transversals of Disjoint Sets', Journal of the London Mathematical Society s1-43, 495–500. DOI: 10.1112/jlms/s1-43.1.495. URL: https://doi.org/10.1112/jlms/s1-43.1.495
- P. Erdős, A. Hajnal, E. C. Milner (1968), 'On sets of almost disjoint subsets of a set', Acta Mathematica Academiae Scientiarum Hungaricae 19, 209–218. DOI: 10.1007/BF01894696. URL: https://doi.org/10.1007/BF01894696
- P. Erdős, A. Hajnal (1971), 'Unsolved problems in set theory', in Axiomatic Set Theory, Proc. Sympos. Pure Math. XIII, Part I, American Mathematical Society, 17–48. zbMATH: Zbl 0228.04001. URL: https://zbmath.org/3361883
- A. Kanamori (1986), 'Partition relations for successor cardinals', Advances in Mathematics 59, 152–169. DOI: 10.1016/0001-8708(86)90049-6. URL: https://doi.org/10.1016/0001-8708(86)90049-6
- P. Komjáth, E. C. Milner (1987), 'On representing sets of an almost disjoint family of sets', Mathematical Proceedings of the Cambridge Philosophical Society 101, 385–393. DOI: 10.1017/S0305004100066779. URL: https://doi.org/10.1017/S0305004100066779
- S. Todorcevic (1987), 'Partitioning pairs of countable ordinals', Acta Mathematica 159, 261–294. DOI: 10.1007/BF02392561. URL: https://doi.org/10.1007/BF02392561
- D. J. Walker (1988), 'On the transversal hypothesis and the weak Kurepa hypothesis', Journal of Symbolic Logic 53(3), 854–877. DOI: 10.2307/2274577. URL: https://doi.org/10.2307/2274577
- P. Szeptycki (2007), 'Transversals for strongly almost disjoint families', Proceedings of the American Mathematical Society 135(7), 2273–2282. DOI: 10.1090/S0002-9939-07-08714-X. URL: https://doi.org/10.1090/S0002-9939-07-08714-X
- M. Kojman (2016), 'On the arithmetic of density', Topology and its Applications 213, 145–153. DOI: 10.1016/j.topol.2016.08.016. URL: https://doi.org/10.1016/j.topol.2016.08.016
- M. Golshani (2019), 'The generalized Kurepa hypothesis at singular cardinals', Periodica Mathematica Hungarica 78(2), 200–202 (published online 2018). DOI: 10.1007/s10998-018-0267-7. URL: https://doi.org/10.1007/s10998-018-0267-7
- R. Mohammadpour (2024), 'Martin's Axiom and Weak Kurepa Hypothesis', arXiv:2411.04835. URL: https://arxiv.org/abs/2411.04835
- J. Krueger, S. Stejskalová (2025), 'A Strongly Non-Saturated Aronszajn Tree Without Weak Kurepa Trees', arXiv:2506.06878. URL: https://arxiv.org/abs/2506.06878