Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Standings of two targets. Two passages below differ from the standings that the problem pages record. The section on Problem 1220 treats the problem as open and leaves the reported counterexample of Shelah and Stanley [170] to a status search; the problem page reads their Theorem 3, a consistent failure of the relation at , which meets both hypotheses in ZFC, accepts it as the not-provable side and, with the positive answer of Erdős, Hajnal and Rado under GCH as the not-disprovable side, records the problem as independent; the strong-limit transfer and the type-count obstruction of that section are unaffected. The paragraph on the two wordings in the section on Problem 1218 takes the page's statement to be the earlier wording, with first target ; the problem page states the corrected relation, with first target , which erdosproblems.com adopted on 7 September 2026 to fix a transcription error, and rejects Li's claim because it answers only the earlier wording, whose relation is a theorem of Erdős, Hajnal and Rado. The implication from Problem 1167 recorded in that section concerns the corrected relation and stands.
Scope. This page carries the mechanism reconstructed in Lemma 1.1 (canonization by types on fast-growing blocks) and Theorem 1.2 (the reduction of a coloring of pairs on to a coloring of pairs on ), specialized in Corollary 1.3 to Problem 1219, to the other problems that use the same objects, and records for each what the transfer gives, what it does not give, and why. Every statement here is author-recorded, no problem status changes, and no tier is assigned. The statements were independently reviewed as they stood on 2026-09-28T13:50:48Z by seven focused reviews graded in the connections grade, which passes all seven and accepts fourteen corrections, since applied. Since the review, the Target paragraph of the Problem 1219 section and the Conjecture 1A section's reference to the problem page's search were restated against the current problem page without dates; this touches no examined statement, proof, code or input. Sources are cited at the standing their library pages record; the survey of Komjáth 2025 is read from its held conversion, and reading outside the held corpus is limited to the erdosproblems.com pages named in each section. Notation is that of the theorem page: for cardinals, for repetitions of the target , and . A block decomposition of a set is a partition into pieces.
Tools
Three facts are used below. The first restates what Theorem 1.2's proof consumes from the lemma, so that later sections can apply it without repeating the verification; the other two are recorded here with their proofs.
(T1) The lemma's interface. Let be an infinite regular cardinal, let () be infinite cardinals, strictly increasing, with and strictly increasing, let , let be pairwise disjoint sets with , and let be a function of finitely many places on . Then Lemma 1.1 applies with its , , these , and , and any properties satisfying its realizability hypothesis (H): Step 2(a) and Step 5 of the theorem page verify the regularity and monotonicity of the , the growth condition and from exactly these assumptions (Step 5 uses , , the strict increase of the powers and the infinitude of each , and nothing about ). Its conclusion gives and with , clauses (1A), (1B) and (2), and for two-place the canonical form for , , , as in Step 6.
(T2) Composition with a witness at the cofinality. Let be a singular cardinal, , , and let () be cardinals with . Then .
Proof. Fix a witness and a block decomposition with . Color a pair inside one with and a pair with , , , with . Let be homogeneous in color with and . If then is bounded in the regular , so lies in fewer than sets of size less than and ; hence , and is -homogeneous in color , a contradiction. Let be homogeneous in a color with . Pairs inside a block have color , so meets each block in at most one point, , and is -homogeneous in color , a contradiction.
The case , is the necessity remark Komjáth prints under Problem 4 (p. 419); the case , is used for Problem 1218 below.
(T3) The converse of Theorem 1.2 at the cofinality. Let be singular with , suppose is not eventually constant, and suppose . Then .
Proof. Choose cardinals (), strictly increasing and cofinal in , with strictly increasing; Step 1 of the theorem page does this from the non-constancy alone, the bound being unnecessary here. Since , the powers are cofinal in , so and, by the sum formula of the theorem page, , the last step because the sum has terms with supremum at least . Take a block decomposition with , on each a Sierpiński coloring of with no homogeneous set of size ((S) on the theorem page), and a witness for ; color a pair inside by and a pair across blocks by . Let be homogeneous in a color with , and as before. Each is -homogeneous, so . If , then is bounded by some and , since is a limit cardinal; so , and choosing one point of in each block of shows that is -homogeneous in color , a contradiction.
Problem 1219 beyond the catalog question
Target. Problem 1219 (status solved,
claim proved; its Current assessment rests on Corollary 1.3, with Komjáth's
survey as the acceptance record). Its Known Results record, from
erdosproblems.com and not from a held source, that with in place
of the answer is yes for and no for
; and they record Hajnal's Conjecture 1A as a separate open
question, treated in its own section below.
What transfers. Theorem 1.2 is already the general form, and (T3) is its converse at the cofinality. Together with two classical facts they give the exact dividing line (author-recorded): for a singular cardinal ,
The direction from right to left is Theorem 1.2: the first condition is "eventually ", since is nondecreasing. For the other direction: if for every , then by the sum formula, and for every singular (color a pair by whether its points lie in the same piece of a block decomposition into pieces of size below , the coloring on the theorem's result page); if the powers are eventually constant with value , then and Sierpiński's with gives ; and if the first two conditions hold but the third fails, (T3) applies. Since an uncountable regular satisfies exactly when it is weakly compact, the third condition says that is or weakly compact. In particular in ZFC, whatever the powers do, while for , of countable cofinality, the relation holds exactly when the sequence is not eventually constant and some is at least (then above it, since ); in the form Bloom's catalog prints the problem, with in place of , the sum keeps its integer indices and the erdosproblems.com bullet is a theorem of ZFC on both sides: for , blocks of size carrying Sierpiński colorings, with one color across blocks, admit no homogeneous set of size (a homogeneous set in the across-block color meets each block in at most points, so has size at most ; one in the other color lies inside one block), so whatever the powers are; for , the relation (ER) of the theorem page at a block with gives with and . The characterization above concerns the different sum , for which the answer at is yes under consistent cardinal arithmetic (for instance for , an Easton pattern) and no in ZFC at ; the source erdosproblems.com attributes the bullet to ([ErHa71], p. 20, not held) should be read before the bullet is recorded in either form.
Falsification checks. (T3) carries the non-constancy hypothesis only to match Theorem 1.2's: its proof takes the from Step 1 but uses nothing about the powers beyond , which the sum formula gives for any strictly increasing cofinal of infinite cardinals, since ; so its conclusion holds for every singular with , and when the powers are eventually constant it also comes from Sierpiński alone, so the case split loses nothing. The Sierpiński colorings are used at , where they exclude homogeneous sets of size inside a block, which is the only place the argument differs from (T2). The regular case is outside this page: for uncountable regular the relation reduces to weakly compact (at it is Ramsey's theorem) and is not touched by the mechanism.
Outcome. Transfers, as a by-product: the converse (T3) and the characterization above; no lead, since Problem 1219 is proved and the characterization has no open case.
Problem 1220: the singular unbalanced relation
Target. Problem 1220 (status open, no
compiled assessment) asks whether for every
singular such that and are
both -inaccessible, that is, for
and likewise for . It is Problem 4
of the Erdős--Hajnal list. Komjáth's commentary (pp. 419--420, read in the held
conversion) records: the hypotheses are necessary, by
and by (T2); the simplest case is
, where the hypothesis on
implies the one on by a
theorem of Shelah, so that this satisfies the hypotheses in ZFC; an
Erdős--Rado theorem ([45, Theorem 35.4] in the survey's numbering) gives the
positive relation when is strong limit; Shelah and
Stanley ([170]) constructed a forcing that adds a counterexample to
while preserving
the powers below a prescribed ; and ([171]) from
measurable cardinals they obtained a model where
is not strong limit and the relation holds. None of
[45], [170], [171] is held. If the summary of [170] is accurate, the universal
question, read as a question of ZFC, has a consistent negative answer at
, and the erdosproblems.com label open should
be re-examined by a status search before anything is recorded on the problem
page. The erdosproblems.com page (accessed 2026-09-28; last edited 1 September
2026) states the problem, the necessity of the conditions and the simplest case,
and lists one proof claim in its forum, not read here.
What transfers: the strong-limit case. The mechanism reduces the relation to its cofinality exactly when is strong limit. The transfer lemma (author-recorded):
Let be a singular strong limit cardinal, , and a cardinal with . Then .
Proof. Let and suppose has no homogeneous set of size in color ; a homogeneous set of size in color is to be found. Since for , the powers below are not eventually constant, so Step 1 of the theorem page, run without its bound , gives infinite cardinals (), strictly increasing and cofinal in , with and strictly increasing. Put ; as is strong limit, , and by the sum formula, so has a block decomposition with . For let say that is homogeneous in color with . (H) holds: for with , the relation (ER) of the theorem page with , transported to , gives a homogeneous set of size in color or one of size in color ; the second is excluded, and a subset of the first of size serves. By (T1) with the two-place of Step 5, the lemma gives with , homogeneous in color , and a well-defined with for , , . Apply to . If with is -homogeneous in color , then is -homogeneous in color , by the argument of Step 7, and , as there. If with is -homogeneous in color , choose for ; distinct lie in distinct blocks and , so is homogeneous in color of size , which was excluded.
With : if is singular strong limit and , then , and with (T2) the two relations are equivalent for strong limit . For a regular -inaccessible the hypothesis is the Erdős--Rado theorem for pairs (for successor it is Theorem 7(i) of the held Erdős and Rado (1956), printed p. 432, PDF p. 6: for the least with , and forces ; the regular limit case is not held; the regular case is not what the problem asks), so the transfer lemma proves the strong-limit case of the problem, whose instance Komjáth attributes to [45, Theorem 35.4]; [45] is not held, so how much of the case its theorem covers is not checked here, and nothing new is claimed.
What does not transfer, and why. For that is -inaccessible but not strong limit, the mechanism is blocked at its type count. The sets must have sizes cofinal in , so the parameter sets have sizes cofinal in ; the number of types over is in general (bound (A) on the lemma page), and the second thinning needs it below the block size . If for some , then for every with , and the count that the second thinning of the lemma page uses no longer yields a fiber of size . Choosing the below the least such keeps the count but bounds , so the final set is too small. This is an obstruction to the counting of Lemma 1.1 over full parameter sets, not to canonization as such and not a proof of the negative relation; the consistent counterexample of [170] and the consistent positive answer of [171] at a non-strong-limit , both as reported by Komjáth, show that the open part is not decided by cardinal arithmetic of this kind, and any proof must use the -inaccessibility of in a way that does not pass through . The finite-color variant would follow from a positive answer by the color-merging induction of the Problem 1171 connections page, as that page notes; it is not a route.
Next investigation. (i) Acquire Shelah and Stanley [170] and [171] and record on the problem page what is proved: whether the model of [170] keeps both -inaccessibility hypotheses, which decides whether the universal question is independent of ZFC, and what [171] assumes. (ii) If the question survives as a ZFC question for some class of , the obstruction above says the proof cannot canonize over parameter sets of size with ; a positive outcome would need a canonization that uses only countable parameter sets, which -inaccessibility can count, and a negative outcome is a counterexample of the [170] kind.
Outcome. Transfers to the strong-limit case, proved through the lemma from the Erdős--Rado theorem for pairs at the cofinality; fails beyond it, with the type-count obstruction; no lead, since the open part is exactly where the mechanism is blocked and its status needs a source-level search first.
Hajnal's Conjecture 1A: triples
Target. The stronger question recorded on Problem 1219's page and on the paper's Conjecture 1A page: under ,
that is, every has a homogeneous set of size in color or a homogeneous -element set in color . Shelah's Remark (p. 1261) asserts without proof; Komjáth (p. 419) records the conjecture as unproven; the search recorded on the problem page found nothing later. It is not an erdosproblems.com problem, and its status is not tracked by a problem page.
What transfers: the endgame. Keep the blocks () of Step 2 of the theorem page for , with and the of Step 1, so that . For a triple meeting the blocks call its pattern. The mechanism's final step, the Ramsey argument on canonical values, survives the passage to triples in the following form. Say that satisfies the canonization statement (C) when there are sets () with , constantly on , a triple with , such that with :
- (P1) for , takes one value for all , , ;
- (P2) for , takes one value for all and ;
- (P3) for , takes one value for all and .
Endgame lemma (author-recorded). Suppose every that has no homogeneous -set in color and no homogeneous set of size in color inside a single block satisfies (C). Then Conjecture 1A holds.
Proof. Let . If has a homogeneous -set in color , or a block contains a homogeneous set of size in color , there is nothing to prove; otherwise take from (C). Ramsey's theorem for triples, , gives an infinite on which is constant, say , and Ramsey's theorem for pairs, applied twice, an infinite on which and are constant, say and . Five cases, the second of which is covered by the first and third. If : one point of for each of four indices gives a -set all of whose triples have pattern with and color . If : for in , two points of and two of give a -set whose triples have patterns and , all of color . If and : for in , together with one point of is a -set, its triple of color and its other three triples of pattern and color . If and : one point of together with , by (P3) at the pairs of . In the remaining case , and is homogeneous in color : a triple inside one has color by the choice of , and the other triples have patterns , or with values , , . As is infinite, as in Step 7.
The triples enter only through the two mixed cases; they are what the hypothesis "no color- set of size inside a block" buys, since under it every subset of of size contains a triple of color . The coloring that gives color exactly to the triples of pattern , , has no homogeneous -set in color , and its homogeneous sets of size in color lie, up to finitely many points, inside a single block; it shows that the case , cannot be handled without the .
What the lemma gives toward (C). Apply (T1) with the three-place extending symmetrically (and by on tuples with a repeated entry), with properties that realize and inside every full-size subset of , as (H) realizes the two homogeneous sets for pairs, with in place of (ER), together with whatever (P2) turns out to need. Then:
- (P1) up to its lowest point. By (1B) with , for , , , : . The dependence on is what clause (3) removes, by passing to a fiber of inside , a map with at most values; the fiber has size when , the reading of the hypothesis here. That can be arranged, by starting Step 1 above , exactly when ; the conjecture's hypothesis allows , and then the fiber argument fails. Clause (3)'s heredity hypothesis fails for the property with , since a same-size subset of may omit the triple; its fiber argument applies to alone, with kept, since (P1) is asked on the .
- (P2) up to the pair. By (1A) at with and the first thinning of the lemma page, which gives and the same type over , for ; so (P2) says that , a coloring of with at most colors, is constant on . The lemma's thinnings fix the types of single elements over and never look at two elements of one block, so this must be built into and realized inside every of size . The Erdős--Rado relation (Theorem 39(i) of the held Erdős and Rado (1956) with ) gives, when , a -homogeneous of size , inside which the relation helps no further (it applies only when for some , and then gives , so it yields a color- set of size only), and inside which a color- triple is not guaranteed, because ; a -homogeneous set of size cannot be asked, as is a successor cardinal. So (P2) needs a block statement of its own: in every of size , for the coloring induced by against any choice of higher points, jointly with the coloring of the (P3) bullet, a set as in (C) on which that coloring is constant, or a homogeneous -set of in color . Open here.
- (P3) not at all. With and , neither nor is a parameter of the other's type, and no clause of the lemma relates to anything. (P3) implies that the restriction of , a coloring of with at most colors, to the coordinates is constant, and asks in addition that its common value be constant on each , ; the route needs the converse direction, constancy of all of , which is what the lemma's property must realize. Constancy of alone does not give this: if on every triple of pattern with not constant on , then is constant for every choice of while (P3) fails. Once every is constant, the second demand follows by thinning each to a fiber of , a map with at most values, taken jointly with the fiber of (P1) under the same hypothesis ; the values do not change when the are thinned later. Here for every , so the number of colors exceeds the target, and Erdős--Rado at the block size would need , a double-exponential growth the hypothesis does not supply; when there are colorings of with colors and no homogeneous triple (, as Komjáth notes under Problem 5). Making the earlier blocks smaller does not help, because the must be cofinal in while every with exceeds . Whether the particular induced by an without color- -sets admits a homogeneous is the consequential gap.
Falsification checks. The endgame uses only the values on the and the two Ramsey theorems; its four cases are exhaustive, since and every triple with a is covered. The block sizes are those of Theorem 1.2, so (T1) applies verbatim; the printed Remark after Lemma 1.1, that the lemma could be refined along the lines of the paper's [7], § 5, may bear on (P3) and was not read. The three-color form of Theorem 1.2 says nothing here: it adds a color with target to pairs, while the conjecture raises the exponent.
Next investigation. Attack (P3) first, since (P1) and (P2) reduce to cardinal arithmetic under and a block statement of Erdős--Rado type, while (P3) has no such reduction: decide whether an without homogeneous -sets in color forces the induced pair colorings to have homogeneous sets of size containing a color- triple, in blocks of size . A positive outcome for the joint block statement, realizing inside every full-size subset of a set on which both and the (P2) coloring are constant, with the fiber step of the (P3) bullet that makes the common value of each constant on the lower , proves the conjecture under by the endgame lemma; a negative outcome, a coloring defeating (P3) in every choice of the sets in all of the blocks, shows that (C) fails for this on these blocks, so the route as formulated is closed, while a weaker canonical form or another decomposition is not excluded; its is a candidate for a counterexample to be tested against the conjecture directly. In either case the imported inputs and (Ramsey; Erdős, Hajnal and Rado 1965, neither held) should be located on their pages before the route is built on.
Outcome. Transfers conditionally: the endgame lemma reduces the conjecture to the canonization statement (C), of which the lemma supplies (P1) under and half of (P2), and nothing of (P3). Filed as the lead triple canonization for Hajnal's conjecture.
Problem 1218: the negative triple relation under GCH
Target. Problem 1218 (status open, no
compiled assessment) asks, under GCH and with ,
whether ; this
is the erdosproblems.com wording of 2026-09-04, which the page carries, and it
agrees with Komjáth's Problem 1 (p. 419),
. The erdosproblems.com page
(accessed 2026-09-28; last edited 7 September 2026) now prints
, with the first target
rather than , states the general
Erdős--Hajnal--Rado conjecture
for ordinals with , with the least such ordinal (the page does not define ), cites [EHR65, p. 131], and lists one comment and one proof claim in its forum, not read here. The two wordings are different relations: erdosproblems.com's current one is the stronger negative statement, and it implies the page's by weakening the first target. Which one the sources state is for the problem page's status search to settle; both are addressed below.
Why the mechanism fails. The mechanism builds positive relations from positive relations on blocks; the problem asks for a negative one. Even for the positive relation that would refute it, the resource is a regular cardinal, so any block decomposition into fewer than pieces has a piece of full size, and the block-to-cofinality reduction has nothing to reduce to; and Theorem 1.2's at is, under GCH, , not , and its hypothesis "eventually " fails. The composition (T2) produces negative relations for pairs on singular resources, which is the wrong exponent and the wrong resource. Nothing here bears on the problem.
Context recorded: the stepping-up instance. Under GCH, , and the erdosproblems.com form of the problem is the case , , () of the negative stepping-up implication that Problem 1167 asks about, applied to the relation . That relation holds under GCH (author-recorded): , and Komjáth's commentary on Problem 5 (p. 420) records the theorem of [45, Section 20] that implies for singular , which at gives under GCH (the GCH case of Problem 1168); (T2) with and lifts it to . So a positive answer to Problem 1167 in its case with one singular target and the others finite, the case its authors could not settle even under GCH per the erdosproblems.com page of Problem 1167, would prove Problem 1218 in the erdosproblems.com form and hence in the page's form; and a model of GCH in which Problem 1218 fails in the erdosproblems.com form would refute Problem 1167. This is a connection between two problems recorded from the survey, not a product of the mechanism.
Outcome. Fails, with the regular-resource obstruction; the implication from Problem 1167 is recorded for both problem pages; no lead.
Problem 1167: the negative stepping-up lemma
Target. Problem 1167 (status open,
claim none; its current assessment judges the statement with the
conditions and of the Erdős--Hajnal list) asks
whether
implies ; the erdosproblems.com
page (accessed 2026-09-28; last edited 1 September 2026) lists the proved cases
from [EHMR84] and names with one singular and the others
finite as the difficult case. Komjáth prints it as Problem 2 with the same case
list (p. 419).
What transfers. Nothing. The mechanism proves positive relations on a sum of powers from positive relations at the cofinality and on blocks of size ; the stepping-up lemma relates a relation on to one on with the exponent raised, and neither Theorem 1.2 nor (T2) or (T3) changes the exponent. Two remarks locate the mechanism's results relative to the problem. First, Theorem 1.2 and Hajnal's conjecture sit next to the difficult case: for the relation is trivial, so the implication asked would give for every ; that relation holds outright, from (author-recorded; a theorem of Erdős, Hajnal and Rado 1965, not held: order lexicographically, fix a well-order of it, and color a triple exactly when its lexicographic middle element is the well-order-least of the three; in a color- four-element set the two middle elements would each precede the other, and in a color- set of size the elements with at most elements of the set below them, and likewise above, number at most each, since the lexicographic order carries no monotone sequence of length , so the well-order-least of the remaining elements has elements of the set on both sides; the derivation is written out as Lemma B of the section's review), so this instance of the implication is settled, while Conjecture 1A asserts the positive relation for the sum of these powers; the two are compatible, as Sierpiński's is compatible with Shelah's , and a proof of the conjecture would show that the sum of the powers behaves differently from each summand at exponent as well. Second, the instance of the difficult case that is itself an erdosproblems.com problem is Problem 1218, as the previous section records.
Outcome. Not applicable; the Problem 1218 instance is recorded; no lead.
Other relations in the set-theory folder
The mechanism needs a resource that is a union of blocks of regular sizes growing to the resource, a coloring of pairs (or, with the gaps above, triples), and a positive relation at the cofinality. It does not apply to Problem 1168, a negative relation on the regular cardinal , beyond the GCH remark in the Problem 1218 section, which uses (T2) at the singular and not at ; nor to Problem 70, a relation for triples with an ordinal target on the reals: (T1) passes to the lemma the hypothesis , which puts every domain of the lemma above , and Theorem 1.2's resource exceeds , so no coloring of a set of size continuum is in the mechanism's scope, while (T2) and (T3) produce negative relations for pairs and bear on no positive relation for triples; nor to Problem 1170 and Problem 1172, balanced or ordinal-target relations on the regular cardinals and ; nor to Problem 598, which colors countable subsets rather than finite tuples. The set mappings of Problem 623 and Problem 1173 live at and , but a free set is not a homogeneous set, and the type canonization has no clause for them; their obstructions are on the Problem 501 connections page. In the other direction, the Problem 1171 connections page records that its color-merging induction does not apply to Problem 1219, a balanced cardinal relation; the mechanism here is the one that proves that relation, and the two are disjoint in what they consume.
Outcomes
- Problem 1219: transfers, as by-products. The converse (T3) and the characterization: for singular , holds exactly when some , the powers are not eventually constant, and is or weakly compact.
- Problem 1220: transfers to the strong-limit case, proved from the Erdős--Rado theorem for pairs at the cofinality (the transfer lemma: strong limit singular and with give ); fails for non-strong-limit , with the type-count obstruction; the survey's report of a consistent counterexample at is flagged for the problem page's status search.
- Hajnal's Conjecture 1A (on Problem 1219's page): transfers conditionally. The endgame lemma reduces it to the canonization statement (C); the lemma gives (P1) under and half of (P2); (P3) is the gap. Lead filed.
- Problem 1218: fails, regular resource and wrong direction; the implication from the difficult case of Problem 1167 is recorded, with the GCH premise proved by (T2); the two erdosproblems.com wordings are flagged.
- Problem 1167: not applicable; the Problem 1218 instance is recorded.
- Problems 1168, 70, 1170, 1172, 598, 623 and 1173: not applicable.