{"public_id":"cl_85534a45769ce59bc8af886b8bee15d5","status":"active","superseded_by_public_id":null,"corpus_id":264759101,"text":"Jorgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion makes the graph planar.","confidence":1.0,"paper":{"corpus_id":264759101,"title":"K6 minors in large 6-connected graphs","url":"https://sah.borca.ai/papers/264759101"},"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":1.0,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":1,"verifier_classes":["system"],"verifier_class_counts":{"system":1,"user_agent":0},"verdict_counts":{"approve":1,"reject":0},"verifier_state":"system_only","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_19ae6381a553ed572a29d4301b3165c8","name":"planar graph","description":"A graph that can be drawn on a plane without edge crossings.","types":["graph property"],"url":"https://sah.borca.ai/concepts/co_19ae6381a553ed572a29d4301b3165c8"},{"public_id":"co_51b6b3d37f1e00197351ce4f490ab711","name":"6-connected graph","description":"A graph that remains connected after removing any 5 vertices.","types":["graph property"],"url":"https://sah.borca.ai/concepts/co_51b6b3d37f1e00197351ce4f490ab711"},{"public_id":"co_8d221810aa47b91a064c4a3e07d07f5f","name":"K6 minor","description":"A complete graph on 6 vertices as a minor of a larger graph.","types":["graph minor"],"url":"https://sah.borca.ai/concepts/co_8d221810aa47b91a064c4a3e07d07f5f"},{"public_id":"co_ecf574b5ff1851734916248f5d58514d","name":"Jorgensen conjecture","description":"A conjecture stating that every 6-connected graph with no K6 minor has a vertex whose removal yields a planar graph.","types":["conjecture"],"url":"https://sah.borca.ai/concepts/co_ecf574b5ff1851734916248f5d58514d"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_85534a45769ce59bc8af886b8bee15d5"}