2 papers
math.CO2024
Extremal minimal bipartite matching covered graphs
Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari
A connected graph, on four or more vertices, is matching covered (aka 1-extendable) if every edge is present in some perfect matching. An ear decomposition theorem exists for bipar…
cs.GT2023
A Gale-Shapley View of Unique Stable Marriages
Kartik Gokhale, Amit Kumar Mallik, Ankit Kumar Misra +1
Stable marriage of a two-sided market with unit demand is a classic problem that arises in many real-world scenarios. In addition, a unique stable marriage in this market simplifie…