2 papers
math.CO2026
Circular sorting, strong complete mappings and wreath product constructions
Paul Bastide, Anurag Bishnoi, Carla Groenland +2
We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort labelled points on a circle by transpositions. Imagine that th…
math.CO2026
-free matching covered graphs: characterization and consequences
Rohinee Joshi, Santhosh Raghul, Ajit A. Diwan +1
The Ear Decomposition Theorem of Lovász & Plummer (1986) implies that every matching covered graph (MCG), except and cycles, contains (at least) one of and as a c…