/- 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 836

References:

    erdosproblems.com/836

    [ErLo75] Erdős, P. and Lovász, L., Problems and results on {$3$}-chromatic hypergraphs and some related questions. (1975), 609--627.

    [Pr26] Price, L., A Linear Intersection Bound. (2026).

@[expose] public sectionnamespace Erdos836open Filter Asymptotics

Let $r\geq 2$ and let $G$ be an intersecting $r$-uniform hypergraph with chromatic number $3$. Must $G$ contain $O(r^2)$ many vertices? Vertices are counted in the union of the edges, so isolated vertices are excluded.

Alon has provided a counterexample to the first question: this hypergraph is intersecting, its chromatic number is $3$, and it has $\asymp 4^r/\sqrt{r}$ many vertices.

@[category research solved, question, AMS 5, formal_proof using lean4 at "https://github.com/linrock/math-proofs/blob/ad12db51383ed41ec8b6b54e0ffabfa828773d38/erdos-836/Solution.lean#L33"] theorem erdos_836.parts.i : ¬ ∃ C : ℝ, 0 < C ∧ ∀ r : ℕ, 2 ≤ r → ∀ (n : ℕ) (H : Finset (Finset (Fin n))), H.IsUniform r → H.HasHypergraphChromaticNumber 3 → (H : Set (Finset (Fin n))).Intersecting → ((H.biUnion id).card : ℝ) ≤ C * (r : ℝ) ^ 2 := ⊢ ¬∃ C, 0 < C ∧ ∀ (r : ℕ), 2 ≤ r → ∀ (n : ℕ) (H : Finset (Finset (Fin n))), H.IsUniform r → H.HasHypergraphChromaticNumber 3 → (↑H).Intersecting → ↑(H.biUnion id).card ≤ C * ↑r ^ 2 All goals completed! 🐙

In an intersecting $r$-uniform hypergraph with chromatic number $3$, must there be two distinct edges which meet in $\gg r$ many vertices?

@[category research solved, question, AMS 5, formal_proof using lean4 at "https://github.com/linrock/math-proofs/blob/ad12db51383ed41ec8b6b54e0ffabfa828773d38/erdos-836/Solution.lean#L41"] theorem erdos_836.parts.ii : ∃ c : ℝ, 0 < c ∧ ∀ r : ℕ, 2 ≤ r → ∀ (n : ℕ) (H : Finset (Finset (Fin n))), H.IsUniform r → H.HasHypergraphChromaticNumber 3 → (H : Set (Finset (Fin n))).Intersecting → ∃ e ∈ H, ∃ f ∈ H, e ≠ f ∧ c * r ≤ ((e ∩ f).card : ℝ) := ⊢ ∃ c, 0 < c ∧ ∀ (r : ℕ), 2 ≤ r → ∀ (n : ℕ) (H : Finset (Finset (Fin n))), H.IsUniform r → H.HasHypergraphChromaticNumber 3 → (↑H).Intersecting → ∃ e ∈ H, ∃ f ∈ H, e ≠ f ∧ c * ↑r ≤ ↑(e ∩ f).card All goals completed! 🐙end Erdos836