Unverified50% confidenceFactExact time
A sandwich graph is defined as follows: given a vertex set V and two edge sets E₁ ⊆ E₂, any graph G=(V,E) satisfying E₁ ⊆ E ⊆ E₂ is a candidate, and the problem is to determine whether any member among them possesses a certain property Π.
1
Sources
50%
Confidence
Long-term
Relevance
9/18/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedA graph with n vertices has 2^(n(n-1)/2) possible configurations63% similarUnverifiedThe Crouzeix conjecture states: for any complex matrix A and any complex analytic function f on its numerical range, ‖f(A)‖ ≤ 2·sup{|f(z)| : z ∈ W(A)}, with the conjecture that the constant 2 is sharp.62% similarUnverifiedThe PPO objective function is L(θ) = E[min(r(θ)·A, clip(r(θ), 1-ε, 1+ε)·A)], where ε is typically set to 0.1 or 0.2.60% similarUnverified在火腿三明治定理的二维证明中，函数满足反足条件g(-v)=-g(v)，使Borsuk-Ulam定理保证存在方向使两个形状被同时平分58% similarUnverified开普勒方程为 M = E - e·sin(E)，其中 M 为平近点角，E 为偏近点角，e 为离心率58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/932545API
curl https://kongchang.com/api/v1/knowledge/claims/932545MCP
get_claim(id=932545)