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…
On the list version of a conjecture of Erdős and Neumann-Lara
Ararat Harutyunyan, Lucas Picasarri-Arrieta, Gil Puig i Surroca
The dichromatic number of a digraph , denoted by , is the smallest number of colours required to colour the vertices of such that each colour class induces an acyc…
Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths
Ararat Harutyunyan, Colin McDiarmid, Gil Puig i Surroca
Given a digraph , we denote by the maximum size of an acyclic set of (i.e. a set of vertices which induces a subdigraph with no directed cycles), and by $\vecχ(D)…