反拉姆齐数

A graph invariant that determines the minimum number of colors required to color the edges of a complete graph such that no monochromatic subgraph isomorphic to a given target graph exists. / 一个图论不变量，用于确定给定的目标图同构于完全图的边染色所需的最少颜色数，且不出现单色子图。

Knowledge type

数学理论

First proposed or discovered

Proposer

Turkey Farm member

Creator

农场主

Last updated

2026-11-06 20:06:09