Unverified50% confidenceFactExact time
A graph with n vertices has 2^(n(n-1)/2) possible configurations
1
Sources
50%
Confidence
Long-term
Relevance
8/9/2026
First Seen
Sources
AI攻克25年数学难题：人工智能如何改变数学研究
Related Claims
Unverified第 n 个折痕的方向由整数 n 的二进制表示唯一确定：将 n 除以 2 直到得到奇数，若结果模 4 余 1 则折痕向右，余 3 则向左72% similarUnverifiedThe Johnson-Lindenstrauss lemma guarantees that for any ε∈(0,1), as long as the target dimension k≥O(log(n)/ε²), there exists a mapping from high dimensions to k dimensions that preserves all pairwise distances within a factor of (1±ε).64% similarUnverified球面亏格为0，环面亏格为1，亏格是衡量曲面复杂程度的拓扑不变量62% similarUnverifiedmath.atan2(y, x)是反正切函数的双参数变体，能根据x、y符号自动判断象限，返回[-π, π]范围的完整角度，而普通arctan返回[-π/2, π/2]61% similarUnverifiedErdős conjectured that the upper bound of U(N) is N^(1+o(1)), where o(1) tends to 0 as N grows.60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/721072API
curl https://kongchang.com/api/v1/knowledge/claims/721072MCP
get_claim(id=721072)