4 papers
Improved lower bounds for the maximum size of Condorcet domains
Alexander Karpov, Klas Markstrom, Soren Riis +1
Condorcet domains are sets of linear orders with the property that, whenever voters' preferences are restricted to the domain, the pairwise majority relation (for an odd number of…
An orderly algorithm for generation of Condorcet Domains
Bei Zhou, Klas Markström
Condorcet domains are fundamental objects in the theory of majority voting; they are sets of linear orders with the property that if every voter picks a linear order from this set,…
Near Triple Arrays
Alexey Gordeev, Klas Markström, Lars-Daniel Ãhman
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows…
Density conditions for vertex-disjoint triangles in tripartite graphs
Mingyang Guo, Klas Markström
Let be positive integers such that and be a tripartite graph with parts such that . Denote the edge densities of , and $…