AFTD Auto-Formalizing Theoretical Domains

op_258_has_mono_clique

def

The colouring c of the edges of K_n has a monochromatic K_k: there are a k-element vertex set s and a colour i such that every edge inside s has colour i.

Statement

def op_258_has_mono_clique (n : ℕ) (c : (SimpleGraph.completeGraph (Fin n)).edgeSet → ℕ+) (k : ℕ) : Prop
Source
step towards op_258_triangle_forcing_implies_decay_ramsey
Verified
18 Oct 2026
Axioms
none listed
Used by 12
  • op_258_has_mono_clique_of_bounded_colorsFor any clique size k ≥ 1 and colour bound C ≥ 1, there exists N such that for all n ≥ N, every edge colouring of K_n with colors at most…
  • op_258_forces_twoFor every decay profile a, a forces a monochromatic K_2.
  • op_258_no_mono_triangle_of_layeringIf an edge colouring c of K_n is subordinate to a bipartite edge layering (so each colour lives in a layer whose endpoints have distinct…
  • op_258_mono_clique_of_fiber_gt_turanIf a single colour class of an edge colouring of K_n has strictly more edges than the Turán bound for K_{r+1}-free graphs (r ≥ 1), then…
  • op_258_forces_mono_boundIf b ≤ a pointwise and a forces a monochromatic K_k, then b forces a monochromatic K_k.
  • op_258_forces_mono_cliqueIf a forces a monochromatic K_k, then a forces a monochromatic K_j for every j ≤ k.
  • op_258_forcesThe decay profile a forces a monochromatic K_k if for all sufficiently large n, every a-bounded colouring of the edges of K_n has a…
  • op_258_forces_iffFor every decay profile a and k, "a forces a monochromatic K_k" holds if and only if the raw statement "for all sufficiently large n,…
  • op_258_sum_ne_top_of_forces_threeIf a positive antitone profile a forces a monochromatic triangle K_3 on sufficiently large complete graphs, then the infinite sum of a_i…
  • decay_ramsey_not_arrow_of_powersIf m ≥ 2 and for every integer ℓ ≥ 1 the complete graph K_{m^ℓ} admits an a-bounded edge-colouring with no monochromatic K_k, then the…
  • op_258_forces_of_capacity_lt_oneIf k ≥ 2 and Σ_i min(a_i, 1 - 1/(k-1)) < 1, then every a-bounded colouring of K_n for large n already contains a monochromatic K_k; i.e. a…
  • op_258_forces_of_forces_smul_blowupFor γ ≥ 1 and k ≥ 1: if a forces a monochromatic K_{γk}, then the profile γ·a forces a monochromatic K_k.

Lean source view module on GitHub

/-- The colouring `c` of the edges of the complete graph on `Fin n` admits a monochromatic `K_k`: a `k`-element vertex set all of whose edges carry one colour. -/
def op_258_has_mono_clique (n : ℕ) (c : (SimpleGraph.completeGraph (Fin n)).edgeSet → ℕ+) (k : ℕ) : Prop := ∃ (s : Finset (Fin n)) (i : ℕ+), s.card = k ∧
    ∀ ⦃u v : Fin n⦄, u ∈ s → v ∈ s → (h : u ≠ v) →
      c ⟨s(u, v), by simp [SimpleGraph.completeGraph_eq_top, h]⟩ = i
See it in the graphDiscuss this resultChallenge it