Tapas Kumar Mishra

activity

20152020

(r, p)

-coloring of hypergraphs

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

collaborators

5 papers

math.CO2020

Modular and fractional L-intersecting families of vector spaces

Rogers Mathew, Tapas Kumar Mishra, Ritabrata Ray +1

In the first part of this paper, we prove a theorem which is the $q$ -analogue of a generalized modular Ray-Chaudhuri-Wilson Theorem shown in [Alon, Babai, Suzuki, J. Combin. Theory…

math.CO2020

A combinatorial proof of Fisher's Inequality

Rogers Mathew, Tapas Kumar Mishra

In this note, we give a simple, counting based proof of Fisher's Inequality that does not use any tools from linear algebra.

math.CO2018

Fractional L-intersecting families

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra

Let $L = {\frac{a _{1}}{b _{1}}, \dots, \frac{a _{s}}{b _{s}}}$ , where for every $i \in [s]$ , $\frac{a _{i}}{b _{i}} \in [0, 1)$ is an irreducible fraction. Let $\mathcal{F} = \{A_1, \ldots , A_m…

cs.DM2015

Strong $(r, p)$ Cover for Hypergraphs

Tapas Kumar Mishra, Sudebkumar Prasant Pal

We introduce the notion of the { \it strong $(r, p)$ cover} number $χ^{c} (G, k, r, p)$ for $k$ -uniform hypergraphs $G (V, E)$ , where $χ^{c} (G, k, r, p)$ denotes the minimum number of $r$ -colori…

cs.DM2015★ 1 cited

An extremal problem in proper $(r, p)$ -coloring of hypergraphs

Tapas Kumar Mishra, Sudebkumar Prasant Pal

Let $G (V, E)$ be a $k$ -uniform hypergraph. A hyperedge $e \in E$ is said to be properly $(r, p)$ colored by an $r$ -coloring of vertices in $V$ if $e$ contains vertices of at least $p…

Modular and fractional L-intersecting families of vector spaces

A combinatorial proof of Fisher's Inequality

Fractional L-intersecting families

Strong (r,p) Cover for Hypergraphs

An extremal problem in proper (r,p)-coloring of hypergraphs

Strong $(r, p)$ Cover for Hypergraphs

An extremal problem in proper $(r, p)$ -coloring of hypergraphs