9 citations · 12 across the 9 of their papers we have counts for
9 papers
Reconstruction of hypergraphs from line graphs and degree sequences
Amitava Bhattacharya, Aloysius Godinho, Pritam Majumder +1
In this paper we consider the problem to reconstruct a -uniform hypergraph from its line graph. In general this problem is hard. We solve this problem when the number of hypered…
A Ramsey Theorem for Graded Lattices
Abhishek Khetan, Amitava Bhattacharya
We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the s…
Covering the Plane by a Sequence of Circular Disks with a Constraint
Amitava Bhattacharya, Anupam Mondal
We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let $(\mathc…
Problems on Matchings and Independent Sets of a Graph
Amitava Bhattacharya, Anupam Mondal, T. Srinivasa Murthy
Let be a finite simple graph. For , the difference of , where is the neighborhood of and …
On the First Eigenvalue of Bipartite Graphs
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bi…
The Polytope of Dual Degree Partitions
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on vertices.