On The "Majority is Least Stable" Conjecture
Aniruddha Biswas, Palash Sarkar

TL;DR
This paper investigates the 'majority is least stable' conjecture, confirming its validity for small cases and disproving it for larger odd numbers, thus clarifying the conjecture's limitations.
Contribution
The paper provides a rigorous analysis of the conjecture, establishing its truth for n=1 and 3, and demonstrating its falsehood for all odd n ≥ 5.
Findings
Conjecture holds for n=1 and 3.
Conjecture is false for all odd n ≥ 5.
Results clarify the limits of the conjecture's applicability.
Abstract
We show that the "majority is least stable" conjecture is true for and and false for all odd .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research
