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
- simple_graph_size_ramsey_le_of_arrowsSanity: if G → (F, H) then r̂(F, H) ≤ e(G).
- simple_graph_size_ramsey_star_star_forest_edges_geLower bound of Lemma 2.3 of arXiv:2610.25958. Every finite graph G with G → (K_{1,p}, ⊔_i K_{1,n_i}) has at least ∑_i (p + n_i - 1) edges.
- simple_graph_size_ramsey_star_star_forestLemma 2.3 of arXiv:2610.25958: for positive integers p, q, n_1 ≥ ... ≥ n_q, r̂(K_{1,p}, ⊔_{i=1}^q K_{1,n_i}) = ∑_{i=1}^q (p + n_i - 1).
- simple_graph_size_ramseyThe size Ramsey number r̂(F, H) = min{e(G) : G → (F, H)} over finite graphs G, taken here as graphs on Fin k; every finite graph is…
- simple_graph_size_ramsey_star_star_forest_arrowsUpper bound of Lemma 2.3 of arXiv:2610.25958. Some finite graph with ∑_i (p + n_i - 1) edges arrows (K_{1,p}, ⊔_i K_{1,n_i}): the disjoint…
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)