
Pliable Index Coding via ConflictFree Colorings of Hypergraphs
In the pliable index coding (PICOD) problem, a server is to serve multip...
read it

Modular and fractional Lintersecting families of vector spaces
In the first part of this paper, we prove a theorem which is the qanalo...
read it

Conflictfree coloring on closed neighborhoods of bounded degree graphs
The closed neighborhood conflictfree chromatic number of a graph G, den...
read it

Fractional cross intersecting families
Let A={A_1,...,A_p} and B={B_1,...,B_q} be two families of subsets of [n...
read it

An Inapproximability Result for the Target Set Selection Problem on Bipartite Graphs
Given an undirected graph G(V, E, τ) modeling a 'social network', where ...
read it

Local Boxicity, Local Dimension, and Maximum Degree
In this short note we focus on two recently introduced parameters in the...
read it

Approximation bounds on maximum edge 2coloring of dense graphs
For a graph G and integer q≥ 2, an edge qcoloring of G is an assignment...
read it

Fractional Lintersecting families
Let L = {a_1/b_1, ... , a_s/b_s}, where for every i ∈ [s], a_i/b_i∈ [0,1...
read it

Dimension of CPT posets
A containment model M_P of a poset P=(X,≼) maps every x ∈ X to a set M_x...
read it

Grid obstacle representation of graphs
The grid obstacle representation of a graph G=(V,E) is an injective func...
read it
Rogers Mathew
is this you? claim profile