10 citations · 25 across the 8 of their papers we have counts for
4 papers · 1 filter
Conflict-Free Coloring of Star-Free Graphs on Open Neighborhoods
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
Given a graph, the conflict-free coloring problem on open neighborhoods (CFON) asks to color the vertices of the graph so that all the vertices have a uniquely colored vertex in it…
Conflict-free coloring on closed neighborhoods of bounded degree graphs
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
The closed neighborhood conflict-free chromatic number of a graph , denoted by , is the minimum number of colors required to color the vertices of such that for e…
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 -analogue of a generalized modular Ray-Chaudhuri-Wilson Theorem shown in [Alon, Babai, Suzuki, J. Combin. Theory…
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.