Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 2 — for every k ≥ 1 some family of plane line segments has no three pairwise intersecting members and χ > k

Proved
TriangleFreeSegments.Probes.theorem_1

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

chromatic-numberintersection-graphline-segmentsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1triangle-free

For every integer k≥1k\ge1k≥1 there is a finite family S=(σi)i<N\mathcal S=(\sigma_i)_{i<N}S=(σi​)i<N​ of pairwise distinct line segments in the plane R2\mathbb R^2R2, each with two distinct endpoints, such that

  1. no three segments of S\mathcal SS pairwise intersect, i.e. the intersection graph of S\mathcal SS (vertices the segments, edges the intersecting pairs) is triangle-free, and
  2. the chromatic number of that intersection graph exceeds kkk:
χ(S)>k.\chi(\mathcal S)>k .χ(S)>k.

This answers negatively Erdős's question whether families of segments in the plane are χ\chiχ-bounded: triangle-free intersection graphs of segments can have arbitrarily large chromatic number.

Formalization Note Segments are closed segments in ℝ × ℝ, the family is indexed by Fin N, and the graph is the intersection graph of those actual segments (not an abstract graph). The chromatic number is Mathlib's chromaticNumber, valued in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}, and the conclusion is the literal χ>k\chi>kχ>k.

Preamble
import Mathlib
import Definitions.Def_TriangleFreeSegments_Probes_Setting
Formal statement
namespace TriangleFreeSegments.Probes

theorem theorem_1 (k : ℕ) (hk : 1 ≤ k) :
    ∃ (N : ℕ) (e : Fin N → (ℝ × ℝ) × (ℝ × ℝ)),
      (∀ i, (e i).1 ≠ (e i).2) ∧
      Function.Injective (fun i => seg (e i)) ∧
      (interGraph (fun i => seg (e i))).CliqueFree 3 ∧
      (k : ℕ∞) < (interGraph (fun i => seg (e i))).chromaticNumber := by sorry

end TriangleFreeSegments.Probes
Source
Pawlik et al., Triangle-free intersection graphs of line segments with large chromatic number, arXiv:1209.1595v5, p. 2, Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me