AFTD Auto-Formalizing Theoretical Domains

simple_graph_size_ramsey_arrows

def

G → (F, H): every red/blue colouring of the edges of G has a red copy of F or a blue copy of H. The red edges form a subgraph R ≤ G and the blue edges are G \ R; a copy is a subgraph isomorphic to the graph.

Statement

def simple_graph_size_ramsey_arrows {V α β : Type*} (G : SimpleGraph V) (F : SimpleGraph α)
    (H : SimpleGraph β) : Prop
Defined in
arXiv:2610.25958 (Size Ramsey numbers of star forests with two components on one side), Section 1: definition of G → (F, H)
Verified
23 Oct 2026
Axioms
none listed
Used by 5

Lean source view module on GitHub

def simple_graph_size_ramsey_arrows {V α β : Type*} (G : SimpleGraph V) (F : SimpleGraph α)
    (H : SimpleGraph β) : Prop :=
  ∀ R : SimpleGraph V, R ≤ G → F.IsContained R ∨ H.IsContained (G \ R)
See it in the graphDiscuss this resultChallenge it