Brahadeesh Sankarnarayanan

activity

20212026

most citedAn ensemble of high rank matrices arising from tournaments

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

collaborators

10 papers

math.CO2026

Tight bounds on the Carathéodory and exchange numbers in $△$ -convexity

Vishnu Kumar, Brahadeesh Sankarnarayanan

The $△$ -convexity space on a finite, simple graph $G = (V, E)$ is the collection $C$ of subsets $S \subseteq V (G)$ such that whenever $x \in V (G)$ forms a triangle…

math.CO2026

On the majority game chromatic number of forests and other graphs

Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan

A majority coloring of a graph $G$ is a vertex coloring of $G$ in which no vertex has more than half of its neighbors colored with its own color. The least number of colors require…

math.CO2024

Bounded fractional intersecting families are linear in size

Niranjan Balachandran, Shagnik Das, Brahadeesh Sankarnarayanan

Using the sunflower method, we show that if $θ \in (0, 1) \cap Q$ and $F$ is a $O (n^{1/3})$ -bounded $θ$ -intersecting family over $[n]$ , then $\lvert \mathcal{F} \r…

math.CO2024

Low-rank matrices, tournaments, and symmetric designs

Niranjan Balachandran, Brahadeesh Sankarnarayanan

Let $a = (a_{i})_{i \geq 1}$ be a sequence in a field $F$ , and $f : F \times F \to F$ 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 $L$ of positive proper fractions and a positive integer $r \geq 2$ , a fractional $r$ -closed $L$ -intersecting family is a collection $F \subset P ([n])$ …

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 $(0, 0)$ to $(n, n)$ . Further resear…

math.CO2021★ 5 cited

An ensemble of high rank matrices arising from tournaments

Niranjan Balachandran, Srimanta Bhattacharya, Brahadeesh Sankarnarayanan

Suppose $F$ is a field and let $a := (a_{1}, a_{2}, \dots)$ be a sequence of non-zero elements in $F$ . For $a_{n} := (a_{1}, \dots, a_{n})$ , we consider…

math.CO2021★ 1 cited

$5$ -list-coloring toroidal $6$ -regular triangulations in linear time

Niranjan Balachandran, Brahadeesh Sankarnarayanan

We give an explicit procedure for $5$ -list-coloring a large class of toroidal $6$ -regular triangulations in linear time. We also show that these graphs are not $3$ -choosable.

math.CO2021★ 1 cited

Note on $4$ -coloring $6$ -regular triangulations on the torus

Brahadeesh Sankarnarayanan

In 1973, Altshuler characterized the $6$ -regular triangulations on the torus to be precisely those that are obtained from a regular triangulation of the $r \times s$ toroidal grid…

math.CO2021★ 2 cited

The choice number versus the chromatic number for graphs embeddable on orientable surfaces

Niranjan Balachandran, Brahadeesh Sankarnarayanan

We show that for loopless $6$ -regular triangulations on the torus the gap between the choice number and chromatic number is at most $2$ . We also show that the largest gap for graph…

Tight bounds on the Carathéodory and exchange numbers in △-convexity

On the majority game chromatic number of forests and other graphs

Bounded fractional intersecting families are linear in size

Low-rank matrices, tournaments, and symmetric designs

On hierarchically closed fractional intersecting families

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

An ensemble of high rank matrices arising from tournaments

5-list-coloring toroidal 6-regular triangulations in linear time

Note on 4-coloring 6-regular triangulations on the torus

The choice number versus the chromatic number for graphs embeddable on orientable surfaces

Tight bounds on the Carathéodory and exchange numbers in $△$ -convexity

$5$ -list-coloring toroidal $6$ -regular triangulations in linear time

Note on $4$ -coloring $6$ -regular triangulations on the torus