62 citations · 268 across the 38 of their papers we have counts for
6 papers · 1 filter
Extremal Numbers of Hypergraph Suspensions of Even Cycles
Sayan Mukherjee
For fixed , determining the order of magnitude of the number of edges in an -vertex bipartite graph not containing , the cycle of length , is a long-standing…
Stability theorems for some Kruskal-Katona type results
Xizhi Liu, Sayan Mukherjee
The classical Kruskal-Katona theorem gives a tight upper bound for the size of an -uniform hypergraph as a function of the size of its shadow. Its stability versio…
Triangles in graphs without bipartite suspensions
Dhruv Mubayi, Sayan Mukherjee
Given graphs and , the generalized Turán number ex is the maximum number of copies of in an -vertex graph with no copies of . Alon and Shikhelman, using a…
Maximum -free subgraphs
Dhruv Mubayi, Sayan Mukherjee
Given a family of hypergraphs , let denote the largest size of an -free subgraph that one is guaranteed to find in every hypergraph with $…
Random Walks on Simplicial Complexes and Harmonics
Sayan Mukherjee, John Steenbergen
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension , a random walk with an absorbing state is define…
A Cheeger-Type Inequality on Simplicial Complexes
John Steenbergen, Caroline Klivans, Sayan Mukherjee
In this paper, we consider a variation on Cheeger numbers related to the coboundary expanders recently defined by Dotterer and Kahle. A Cheeger-type inequality is proved, which is…