2 papers
cs.GT2025
On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
Koustav De
We are given a bipartite graph . In the one-sided model, every (often called agents) ranks its neighbours strictly, and no $…
math.CO2025
A Tight Lower Bound on Cubic Vertices and Upper Bounds on Thin and Non-thin edges in Planar Braces
Koustav De
For a subset of the vertex set $\VV(\GG)$ of a graph $\GG$, we denote the set of edges of $\GG$ which have exactly one end in by and refer to it as the cut of…