6 citations · 11 across the 17 of their papers we have counts for
5 papers · 1 filter
A reverse Sidorenko inequality
Ashwin Sah, Mehtaab Sawhney, David Stoner +1
Let be a graph allowing loops as well as vertex and edge weights. We prove that, for every triangle-free graph without isolated vertices, the weighted number of graph homom…
A stronger connection between the Erdős-Burgess and Davenport constants
Noah Kravitz, Ashwin Sah
The Erdős-Burgess constant of a semigroup is the smallest positive integer such that any sequence over of length contains a nonempty subsequence whose elements mult…
Constraining Strong c-Wilf Equivalence Using Cluster Poset Asymptotics
Mitchell Lee, Ashwin Sah
Let and be permutations. An occurrence of in as a consecutive pattern is a subsequence of wit…
The number of independent sets in an irregular graph
Ashwin Sah, Mehtaab Sawhney, David Stoner +1
Settling Kahn's conjecture (2001), we prove the following upper bound on the number of independent sets in a graph without isolated vertices: \[ i(G) \le \prod_{uv \in E…
On the Discrepancy Between Two Zagreb Indices
Ashwin Sah, Mehtaab Sawhney
We examine the quantity \[S(G) = \sum_{uv\in E(G)} \min(\text{deg } u, \text{deg } v)\] over sets of graphs with a fixed number of edges. The main result shows the maximum possible…