op_258_bounded
def
A colouring c of the edges of the complete graph K_n is a-bounded if for every colour i the number of edges of colour i is at most a i * C(n,2).
Statement
def op_258_bounded (a : ℕ+ → ℝ) (n : ℕ) (c : (SimpleGraph.completeGraph (Fin n)).edgeSet → ℕ+) : Prop
- Source
- step towards op_258_triangle_forcing_implies_decay_ramsey
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 13
- op_258_forces_twoFor every decay profile a, a forces a monochromatic K_2.
- op_258_card_fiber_tail_leFor an a-bounded colouring c of the edges of K_n, the number of edges with colour index strictly greater than C is at most the sum of a_i…
- 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_exists_tail_leFor any positive profile with finite ENNReal sum and any ε > 0, there is a cutoff C such that any finite set of colours strictly above C…
- 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_bounded_extensionFor a positive antitone profile a with Σ a i > 1 there is n₀ such that for every n ≥ n₀, every partially defined a-bounded colouring of…
- op_258_one_le_tsum_of_boundedLet n ≥ 2, let a : ℕ+ → ℝ and let c be an a-bounded colouring of the edges of K_n. Then the ENNReal-sum of the a i is at least 1.
- 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
/-- a-bounded edge colouring of the complete graph on `Fin n`: every colour class has size at most the `a i` fraction of the `C(n,2)` edges. -/ def op_258_bounded (a : ℕ+ → ℝ) (n : ℕ) (c : (SimpleGraph.completeGraph (Fin n)).edgeSet → ℕ+) : Prop := ∀ i : ℕ+, ((Finset.univ : Finset (SimpleGraph.completeGraph (Fin n)).edgeSet).filter (fun e => c e = i)).card ≤ a i * (n.choose 2 : ℝ)