13 citations · 52 across the 53 of their papers we have counts for
5 papers · 2 filters
Separation dimension of bounded degree graphs
Noga Alon, Manu Basavaraju, L. Sunil Chandran +2
The 'separation dimension' of a graph is the smallest natural number for which the vertices of can be embedded in such that any pair of disjoint edges in…
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
The boxicity (respectively cubicity) of a graph is the minimum non-negative integer , such that can be represented as an intersection graph of axis-parallel -dimensio…
Boxicity and separation dimension
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic +2
A family of permutations of the vertices of a hypergraph is called 'pairwise suitable' for if, for every pair of disjoint edges in , there exists a permuta…
Separation dimension of sparse graphs
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew +1
The separation dimension of a graph is the smallest natural number for which the vertices of can be embedded in such that any pair of disjoint edges in $…
On Additive Combinatorics of Permutations of \mathbb{Z}_n
L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh
Let denote the ring of integers modulo . In this paper we consider two extremal problems on permutations of , namely, the maximum size of a collecti…