DeVos, Matt, Funk, Daryl, Goddyn, Luis, Royle, Gordon
{"title":"对于双圆拟阵类,只有有限数量的排除子阵","authors":"DeVos, Matt, Funk, Daryl, Goddyn, Luis, Royle, Gordon","doi":"10.19086/aic.2023.7","DOIUrl":null,"url":null,"abstract":"We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the recently introduced class of quasi-graphic matroids. We show that if $N$ is an excluded minor of rank at least ten, then $N$ is quasi-graphic. Several small excluded minors are quasi-graphic. Using biased-graphic representations, we find that $N$ already contains one of these. We also provide an upper bound, in terms of rank, on the number of elements in an excluded minor, so the result follows.","PeriodicalId":36338,"journal":{"name":"Advances in Combinatorics","volume":"5 20","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"There are only a finite number of excluded minors for the class of bicircular matroids\",\"authors\":\"DeVos, Matt, Funk, Daryl, Goddyn, Luis, Royle, Gordon\",\"doi\":\"10.19086/aic.2023.7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the recently introduced class of quasi-graphic matroids. We show that if $N$ is an excluded minor of rank at least ten, then $N$ is quasi-graphic. Several small excluded minors are quasi-graphic. Using biased-graphic representations, we find that $N$ already contains one of these. We also provide an upper bound, in terms of rank, on the number of elements in an excluded minor, so the result follows.\",\"PeriodicalId\":36338,\"journal\":{\"name\":\"Advances in Combinatorics\",\"volume\":\"5 20\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19086/aic.2023.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19086/aic.2023.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
There are only a finite number of excluded minors for the class of bicircular matroids
We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the recently introduced class of quasi-graphic matroids. We show that if $N$ is an excluded minor of rank at least ten, then $N$ is quasi-graphic. Several small excluded minors are quasi-graphic. Using biased-graphic representations, we find that $N$ already contains one of these. We also provide an upper bound, in terms of rank, on the number of elements in an excluded minor, so the result follows.