18
Voted
GEB
2016
10 years 1 months ago
2016
Working in the Arrovian framework, we search for preference aggregation rules with desirable solidarity properties. In a fixed-population setting, we formulate two versions of th...
142
click to vote
GC
2016
Springer
10 years 1 months ago
2016
Springer
Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph Kn that has no rainbow spanning subgraph with diameter at most t. We prove s(n, t) = n−2 2 ...
256
click to vote
GC
2016
Springer
10 years 1 months ago
2016
Springer
A mixed hypergraph is a triple H = (V, C, D), where V is a set of vertices, C and D are sets of hyperedges. A vertex-coloring of H is proper if C-edges are not totally multicolored...