Counting acyclic and strong digraphs by descents

Overview of attention for article published in Discrete Mathematics, November 2020

Altmetric Badge

About this Attention Score

In the top 25% of all research outputs scored by Altmetric
Good Attention Score compared to outputs of the same age (73rd percentile)
High Attention Score compared to outputs of the same age and source (93rd percentile)

Mentioned by

twitter: 3 X users

q&a: 2 Q&A threads

Readers on

mendeley: 2 Mendeley

So far, Altmetric has seen 3 X posts from 3 X users, with an upper bound of 3,256 followers.

https://t.co/T04fKPkB7S これ頑張って読んでたけど無理だった

https://t.co/jYSO9cHZty K Archer et. al. Counting acyclic and strong digraphs by descents https://t.co/hpdi0dnBA3

Kassie Archer (University of Texas at Tyler), Ira M. Gessel (Brandeis University), Christina Graves (University of Texas at Tyler), Xuming Liang (Harvey Mudd Collwege) : Counting acyclic and strong digraphs by descents https://t.co/NTPH64Yw6u https://t.…

This page shows the most recent X posts that mention this research output. Click here to find out how to access more activity.