research
∙
05/04/2023
Extremal Results on Conflict-free Coloring
A conflict-free open neighborhood coloring of a graph is an assignment o...
share
research
∙
12/22/2021
Conflict-free coloring on open neighborhoods of claw-free graphs
The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFO...
research
∙
02/03/2021
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
In the pliable index coding (PICOD) problem, a server is to serve multip...
research
∙
04/10/2020
Modular and fractional L-intersecting families of vector spaces
In the first part of this paper, we prove a theorem which is the q-analo...
research
∙
03/12/2020
Conflict-free coloring on closed neighborhoods of bounded degree graphs
The closed neighborhood conflict-free chromatic number of a graph G, den...
research
∙
03/05/2019
Fractional cross intersecting families
Let A={A_1,...,A_p} and B={B_1,...,B_q} be two families of subsets of [n...
research
∙
12/04/2018
An Inapproximability Result for the Target Set Selection Problem on Bipartite Graphs
Given an undirected graph G(V, E, τ) modeling a 'social network', where ...
research
∙
10/06/2018
Local Boxicity, Local Dimension, and Maximum Degree
In this short note we focus on two recently introduced parameters in the...
research
∙
10/01/2018
Approximation bounds on maximum edge 2-coloring of dense graphs
For a graph G and integer q≥ 2, an edge q-coloring of G is an assignment...
research
∙
03/11/2018
Fractional L-intersecting families
Let L = {a_1/b_1, ... , a_s/b_s}, where for every i ∈ [s], a_i/b_i∈ [0,1...
research
∙
02/26/2018
Dimension of CPT posets
A containment model M_P of a poset P=(X,≼) maps every x ∈ X to a set M_x...
research
∙
08/05/2017
