/-
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 FormalConjecturesUtilErdős Problem 1024
References:
[PhRo86] Phelps, K. T. and R"odl, V., Steiner triple systems with minimum independence number. Ars Combin. (1986), 167--172.
@[expose] public sectionnamespace Erdos1024open Filter Asymptoticsnoncomputable def erdos_1024.answer : ℕ → ℝ := fun n : ℕ ↦ Real.sqrt (n * Real.log n)Let $f(n)$ be such that every $3$-uniform linear hypergraph on $n$ vertices contains an independent set on $f(n)$ vertices. Estimate $f(n)$.
Phelps and Rödl [PhRo86] proved $f(n) \asymp (n\log n)^{1/2}$.
@[category research solved, question value, AMS 5]
theorem erdos_1024 :
(fun n ↦ (Hypergraph.linearIndependenceNumber n : ℝ)) =Θ[atTop]
erdos_1024.answer := ⊢ (fun n ↦ ↑(Hypergraph.linearIndependenceNumber n)) =Θ[atTop] erdos_1024.answer
All goals completed! 🐙end Erdos1024