← All problems

Petr–Turek conjecture on intersecting temperate families

For every integer k≥2k\ge 2, if A⊆2[2k]\mathcal A\subseteq 2^{[2k]} is an intersecting temperate family, then

∣A∣≤(2k−1k−1)+(2kk+1)+(2k−1k+2).|\mathcal A|\le \binom{2k-1}{k-1}+\binom{2k}{k+1}+\binom{2k-1}{k+2}.

Moreover, equality is conjectured to hold only for a family of the following form: there exists an element a∈[2k]a\in[2k] such that

A={A∈([2k]k):a∈A}∪([2k]k+1)∪{A∈([2k]k+2):a∉A}.\mathcal A=\{A\in\binom{[2k]}{k}:a\in A\}\cup\binom{[2k]}{k+1}\cup\{A\in\binom{[2k]}{k+2}:a\notin A\}.
References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A 2026 paper settles the conjecture for three specific set sizes, but the full even-dimensional problem remains open.

Petr and Turek proposed the even case in 2024, conjecturing both the stated maximum and the unique lightning-shaped extremal family. Their earlier work proves the corresponding odd case.

Known results

  • For odd n=2k−1n=2k-1, Petr and Turek (2024) proved the maximum and classified extremal families.
  • For even n=2kn=2k, Petr and Turek (2024) stated the displayed bound and equality structure as a conjecture.
  • The unrestricted even case is not proved by the cited literature.

September 21, 2026 three-layer result

On September 21, 2026, Kada Williams's preprint claimed that, when A\mathcal A is restricted to the kk, k+1k+1, and k+2k+2 layers, the conjectured bound holds and equality has exactly the lightning form. It explicitly calls this a partial resolution, not a solution of the unrestricted problem. The proof is unverified. Williams says most proof ideas were found with assistance from ChatGPT 5.6 Plus.

Current status (as of October 2026): The odd case is settled, and the three-layer even case is claimed proved but unverified; the full even-case conjecture remains open.

Sources

Solutions 0

No solutions have been posted yet.