{"corpus_id":264759101,"paper_sha":"87866494c92c4b08f0e51f51e977b15ec250d02d","doi":"10.1016/j.jctb.2017.09.007","arxiv_id":"1203.2192","pmid":null,"pmcid":null,"mag_id":2138820240,"dblp_id":"journals/corr/abs-1203-2192","acl_id":null,"title":"K6 minors in large 6-connected graphs","year":2012,"publication_date":"2012-03-09","venue":"J. Comb. Theory B","journal":{"name":"J. Comb. Theory B","pages":"158-203","volume":"129"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Mathematics","Computer Science"],"reference_count":22,"citation_count":4,"influential_citation_count":0,"is_open_access":false,"arxiv_categories":["math.CO","cs.DM"],"arxiv_license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":null,"s2_open_access_landing_url":null,"s2_open_access_license":null,"s2_open_access_status":null,"pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"Jorgensen conjectured that every 6-connected graph with no K_6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs.","claims":[{"public_id":"cl_85534a45769ce59bc8af886b8bee15d5","status":"active","text":"Jorgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion makes the graph planar.","confidence":1.0,"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"}],"url":"https://sah.borca.ai/claims/cl_85534a45769ce59bc8af886b8bee15d5"},{"public_id":"cl_e4fea3ba1a0b123126e8da4094f030d4","status":"active","text":"The conjecture is proved for all sufficiently large graphs.","confidence":0.95,"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"}],"url":"https://sah.borca.ai/claims/cl_e4fea3ba1a0b123126e8da4094f030d4"}],"concepts":[{"public_id":"co_19ae6381a553ed572a29d4301b3165c8","status":"active","name":"planar graph","description":"A graph that can be drawn on a plane without edge crossings.","types":["graph property"],"aliases":[],"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"}],"url":"https://sah.borca.ai/concepts/co_19ae6381a553ed572a29d4301b3165c8"},{"public_id":"co_1d6ede16741c0e2d46e7ac5f1daa301b","status":"active","name":"sufficiently large graphs","description":"Graphs of large enough order for which the proof of the conjecture is established.","types":["graph class"],"aliases":[],"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"}],"url":"https://sah.borca.ai/concepts/co_1d6ede16741c0e2d46e7ac5f1daa301b"},{"public_id":"co_51b6b3d37f1e00197351ce4f490ab711","status":"active","name":"6-connected graph","description":"A graph that remains connected after removing any 5 vertices.","types":["graph property"],"aliases":[],"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"}],"url":"https://sah.borca.ai/concepts/co_51b6b3d37f1e00197351ce4f490ab711"},{"public_id":"co_8d221810aa47b91a064c4a3e07d07f5f","status":"active","name":"K6 minor","description":"A complete graph on 6 vertices as a minor of a larger graph.","types":["graph minor"],"aliases":[],"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"}],"url":"https://sah.borca.ai/concepts/co_8d221810aa47b91a064c4a3e07d07f5f"},{"public_id":"co_ecf574b5ff1851734916248f5d58514d","status":"active","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"],"aliases":[],"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"}],"url":"https://sah.borca.ai/concepts/co_ecf574b5ff1851734916248f5d58514d"}],"external_ids":{"DOI":"10.1016/j.jctb.2017.09.007","ArXiv":"1203.2192","PubMed":null,"PubMedCentral":null,"MAG":2138820240,"DBLP":"journals/corr/abs-1203-2192","ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://arxiv.org/pdf/1203.2192","landing_url":"https://arxiv.org/abs/1203.2192","source":"arxiv","pdf_url_source":"derived_arxiv","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":true,"full_text_source":"arxiv","count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":632424,"paper_uid":"2e960dce-1f6c-473c-9a05-ae3d5528ac68","canonical_identity":{"paper_id":632424,"paper_uid":"2e960dce-1f6c-473c-9a05-ae3d5528ac68","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/264759101"}