15 citations · 57 across the 24 of their papers we have counts for
4 papers · 1 filter
Tournaments not inducible by five voters
Leonid Chindelevitch, Ararat Harutyunyan
How many members must a committee have before its pairwise majorities can express any collective preference? With enough voters every pattern of pairwise majorities, or tournament,…
Tournaments determined by three and five voters
Leonid Chindelevitch, Ararat Harutyunyan
Pairwise majority has been studied since Ramon Llull in the 13th century and Condorcet in the 18th. A tournament records, for each pair of alternatives, which one a majority of vot…
Odd Chromatic Number of Graph Classes
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler +1
A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, o…
Strong edge-colouring of sparse planar graphs
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard +1
A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree has a strong e…