Enumeration of extensions of the cycle matroid of a complete graph

Peter Nelson,Shayla Redlin,Jorn van der Pol

ADVANCES IN APPLIED MATHEMATICS（2022）

引用 0|浏览0

暂无评分

摘要

We prove that the number of single element extensions of the cycle matroid of the complete graph Kn+1 is 2((n/2n) (1 + o (1))). This is done using a characterization of extensions as "linear subclasses". (C) 2022 Elsevier Inc. All rights reserved.

查看译文

关键词

Matroid, Extensions, Enumeration, Clique

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要