Counting Anosov graphs

Meera Mainkar, Matthew Plante, Ben Salisbury

Research output: Contribution to journalArticlepeer-review

Abstract

In recent work by Dani and Mainkar, a family of finite simple graphs was used to construct nilmanifolds admitting Anosov diffeomorphisms. Our main object of study is this particular set of graphs, which we call Anosov graphs. Moreover, Dani and Mainkar give a lower bound on the number of Anosov graphs in terms of the number of vertices and number of edges. In this work, we improve this lower bound in terms of vertices and edges, and we give lower and upper bounds solely in terms of the number of vertices.

Original languageEnglish
Pages (from-to)29-51
Number of pages23
JournalArs Combinatoria
Volume141
StatePublished - Oct 2018

Keywords

  • Anosov graph
  • Graph enumeration
  • Quotient graph

Fingerprint

Dive into the research topics of 'Counting Anosov graphs'. Together they form a unique fingerprint.

Cite this