A. Mondal

activity

20172023

most citedProblems on Matchings and Independent Sets of a Graph

9 citations · 11 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2023

A note on an application of discrete Morse theoretic techniques on the complex of disconnected graphs

Anupam Mondal, Pritam Chandra Pramanik

Robin Forman's highly influential 2002 paper A User's Guide to Discrete Morse Theory presents an overview of the subject in a very readable manner. As a proof of concept, the autho…

math.CO2023★ 1 cited

Topology of matching complexes of complete graphs via discrete Morse theory

Anupam Mondal, Sajal Mukherjee, Kuldeep Saha

Bouc (1992) first studied the topological properties of $M_{n}$ , the matching complex of the complete graph of order $n$ , in connection with Brown complexes and Quillen complexes. Bj…

math.CO2023

Discrete Morse theory and the topology of matching complexes of complete graphs

Anupam Mondal, Sajal Mukherjee, Kuldeep Saha

We denote the matching complex of the complete graph with $n$ vertices by $M_{n}$ . Bouc first studied the topological properties of $M_{n}$ in connection with the Quillen complex. Late…

math.CO2022★ 1 cited

On Elser's conjecture and the topology of $U$ -nucleus complex

Apratim Chakraborty, Anupam Mondal, Sajal Mukherjee +1

Dorpalen-Barry et al. proved Elser's conjecture about sign of Elser's number by interpreting them as certain sums of reduced Euler characteristics of an abstract simplicial complex…

math.MG2018

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…

cs.CL2017

Tracing Linguistic Relations in Winning and Losing Sides of Explicit Opposing Groups

Ceyda Sanli, Anupam Mondal, Erik Cambria

Linguistic relations in oral conversations present how opinions are constructed and developed in a restricted time. The relations bond ideas, arguments, thoughts, and feelings, re-…

math.CO2017★ 9 cited

Problems on Matchings and Independent Sets of a Graph

Amitava Bhattacharya, Anupam Mondal, T. Srinivasa Murthy

Let $G$ be a finite simple graph. For $X \subset V (G)$ , the difference of $X$ , $d (X) := ∣ X ∣ - ∣ N (X) ∣$ where $N (X)$ is the neighborhood of $X$ and $max {d (X) : X \subset V (G)}$ …