{"schema_version":"ocme-site-results-v1","locale":"zh-Hant","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-graph-coloring"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-graph-coloring-01","title":{"zh-Hant":"完整著色與非最優greedy trace","en":"A complete coloring and a nonoptimal greedy trace"},"summary":{"zh-Hant":"逐邊驗proper coloring並展示上界非自動最優。","en":"Audit a proper coloring edgewise and show an upper bound need not be optimal."},"mko_ids":["mko-graph-coloring"]}],"title":"概念推導導讀"}