/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Erdős Problem 644

References:

    erdosproblems.com/644

    [EFKT92] Erdős, P. and Fon-Der-Flaass, D. and Kostochka, A. V. and Tuza, Zs., Small transversals in uniform hypergraphs. Siberian Adv. Math. (1992), 82-88.

@[expose] public sectionnamespace Erdos644open Filter Asymptotics

For $r \geq 3$, the transversal bound satisfies $f(k,r) \leq 2k$.

k:ℕr:ℕhr:3 ≤ rV:TypeF:Set (Finset V)hu:∀ e ∈ F, e.card = khl:∀ (E : Finset (Finset V)), ↑E ⊆ F → E.card ≤ r → (↑E).HasFiniteTransversal 2hthree:∀ {e f g : Finset V}, e ∈ F → f ∈ F → g ∈ F → Disjoint e f → Disjoint e g → Disjoint f g → Falsee:Finset Vhe:e ∈ Ff:Finset Vhf:f ∈ Fhef:Disjoint e fg:Finset Vhg:g ∈ Fh:¬∃ v ∈ e ∪ f, v ∈ gheg:Disjoint e ghfg:Disjoint f g⊢ False All goals completed! 🐙 k:ℕr:ℕhr:3 ≤ rV:TypeF:Set (Finset V)hu:∀ e ∈ F, e.card = khl:∀ (E : Finset (Finset V)), ↑E ⊆ F → E.card ≤ r → (↑E).HasFiniteTransversal 2hthree:∀ {e f g : Finset V}, e ∈ F → f ∈ F → g ∈ F → Disjoint e f → Disjoint e g → Disjoint f g → FalsehF:¬F.Nonempty⊢ F.HasFiniteTransversal (2 * k) exact ⟨∅, k:ℕr:ℕhr:3 ≤ rV:TypeF:Set (Finset V)hu:∀ e ∈ F, e.card = khl:∀ (E : Finset (Finset V)), ↑E ⊆ F → E.card ≤ r → (↑E).HasFiniteTransversal 2hthree:∀ {e f g : Finset V}, e ∈ F → f ∈ F → g ∈ F → Disjoint e f → Disjoint e g → Disjoint f g → FalsehF:¬F.Nonempty⊢ ∅.card ≤ 2 * k All goals completed! 🐙, fun e he ↦ (hF ⟨e, he⟩).elim⟩

The extremal parameter is finite, so its conversion to $\mathbb{N}$ loses no value.

@[category test, AMS 5] theorem transversalBound_lt_top (k r : ℕ) (hr : 3 ≤ r) : Hypergraph.subfamilyTransversalBound k r 2 < ⊤ := lt_of_le_of_lt (erdos_644.variants.elementary_upper_bound k r hr) (ENat.natCast_lt_top (2 * k))

Let $f(k,r)$ be minimal such that if $A_1,A_2,\ldots$ is a family of sets, all of size $k$, such that for every collection of $r$ of the $A_is$ there is some pair ${x,y}$ which intersects all of the $A_j$, then there is some set of size $f(k,r)$ which intersects all of the sets $A_i$. Is it true that $$f(k,7)=(1+o(1))\frac{3}{4}k?$$

@[category research open, question, AMS 5] theorem erdos_644.parts.i : (fun k ↦ ((Hypergraph.subfamilyTransversalBound k 7 2).toNat : ℝ)) ~[atTop] (fun k ↦ (3 / 4 : ℝ) * k) := ⊢ (fun k ↦ ↑(Hypergraph.subfamilyTransversalBound k 7 2).toNat) ~[atTop] fun k ↦ 3 / 4 * ↑k All goals completed! 🐙

Is it true that for any $r\geq 3$ there exists some constant $c_r$ such that $$f(k,r)=(1+o(1))c_rk?$$

@[category research open, question, AMS 5] theorem erdos_644.parts.ii : ∀ r : ℕ, 3 ≤ r → ∃ c : ℝ, 0 < c ∧ (fun k ↦ ((Hypergraph.subfamilyTransversalBound k r 2).toNat : ℝ)) ~[atTop] (fun k ↦ c * k) := ⊢ ∀ (r : ℕ), 3 ≤ r → ∃ c, 0 < c ∧ (fun k ↦ ↑(Hypergraph.subfamilyTransversalBound k r 2).toNat) ~[atTop] fun k ↦ c * ↑k All goals completed! 🐙end Erdos644