{"title":"Simple graphs of order 12 and minimum degree\n6 contain K6 minors","authors":"Ryan Odeneal, Andrei Pavelescu","doi":"10.2140/involve.2020.13.829","DOIUrl":null,"url":null,"abstract":"We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"68 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2140/involve.2020.13.829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
