activity
20212026
most citedOn hierarchically closed fractional intersecting families

2 citations · 2 across the 5 of their papers we have counts for

collaborators

9 papers

math.CO2026

On the majority game chromatic number of forests and other graphs

Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan

A majority coloring (also called an unfriendly partition) of a graph is a vertex coloring of in which no vertex has more than half of its neighbors colored with its own col…

math.CO2024

Bounded fractional intersecting families are linear in size

Niranjan Balachandran, Shagnik Das, Brahadeesh Sankarnarayanan

Using the sunflower method, we show that if and is a -bounded -intersecting family over , then $\lvert \mathcal{F} \r…

math.CO2024

Low-rank matrices, tournaments, and symmetric designs

Niranjan Balachandran, Brahadeesh Sankarnarayanan

Let be a sequence in a field , and be a function such that $f(a_{i},a_{i}) \neq…

math.CO2022★ 2 cited

On hierarchically closed fractional intersecting families

Niranjan Balachandran, Srimanta Bhattacharya, Krishn Vishwas Kher +2

For a set of positive proper fractions and a positive integer , a fractional -closed -intersecting family is a collection …

math.CO2021

The Young matroid: A multiset extension of the Catalan matroid to arbitrary Young diagrams

Hiranya Kishore Dey, Brahadeesh Sankarnarayanan, S. Venkitesh

Introduced by Ardila (J. Combin. Theory Ser. A, 2003), the Catalan matroid is obtained by defining the bases of the matroid using Dyck paths from to . Further resear…

math.CO2021

An ensemble of high rank matrices arising from tournaments

Niranjan Balachandran, Srimanta Bhattacharya, Brahadeesh Sankarnarayanan

Suppose is a field and let be a sequence of non-zero elements in . For , we consider…