Equivalence of Connected and Peak-Pit Maximal Condorcet Domains

2025/05/26 by Li, Guanhao
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2505.19520

Abstract

This paper provides a combinatorial proof to show that, in the study of maximal Condorcet domains, the class of peak-pit Condorcet domains, the class of connected Condorcet domains, and the class of directly connected Condorcet domains are all equivalent.

Related

• Condorcet Domains of Degree at most Seven
• Generalisation of the Danilov-Karzanov-Koshevoy Construction for Peak-Pit Condorcet Domains
• A composition of Condorcet domains
• Counting Condorcet Domains
• A family of Condorcet domains that are single-peaked on a circle