{"public_id":"co_51b6b3d37f1e00197351ce4f490ab711","status":"active","merged_into_public_id":null,"resolved_public_id":"co_51b6b3d37f1e00197351ce4f490ab711","name":"6-connected graph","description":"A graph that remains connected after removing any 5 vertices.","aliases":[],"types":["graph property"],"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":"concept","status":"active","confidence":null,"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","concept.status"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"papers":[{"corpus_id":264759101,"title":"K6 minors in large 6-connected graphs","citation_count":4,"url":"https://sah.borca.ai/papers/264759101"}],"claims":[{"public_id":"cl_85534a45769ce59bc8af886b8bee15d5","text":"Jorgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion makes the graph planar.","corpus_id":264759101,"url":"https://sah.borca.ai/claims/cl_85534a45769ce59bc8af886b8bee15d5"}],"related_concepts":[],"resolved_url":"https://sah.borca.ai/concepts/co_51b6b3d37f1e00197351ce4f490ab711","url":"https://sah.borca.ai/concepts/co_51b6b3d37f1e00197351ce4f490ab711"}