1 citations · 1 across the 2 of their papers we have counts for
5 papers · 1 filter
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…
-list-coloring toroidal -regular triangulations in linear time
Niranjan Balachandran, Brahadeesh Sankarnarayanan
We give an explicit procedure for -list-coloring a large class of toroidal -regular triangulations in linear time. We also show that these graphs are not -choosable.
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…
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}…
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 …