跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 20:16 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 20:23 — 2026-11-19 20:23(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 20:16最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 20:10(北京时间)
版本更新 · v2arXiv:2609.35186

Elections, Fractional Dichromatic Number and Domination in Tournaments and Digraphs

Paul Colinot, Alantha Newman

原文摘要

The dichromatic number of a digraph is the minimum number of induced acyclic sets into which its vertex set can be partitioned. The fractional dichromatic number is its fractional relaxation. Bourneuf, Charbit and Thomassé showed that the domination number of a tournament can be bounded as an (exponential) function of its fractional dichromatic number. This naturally leads to the question of finding a polynomial bound. We show that this bound is linear. To do this, we show a connection between undominated sets in elections and dominating sets in tournaments with bounded fractional dichromatic number. Within this framework, we also connect the well-known question of the existence of small Condorcet winning sets in elections to domination problems in digraphs with fractional dichromatic number less than 2. Thus, we open a new path to investigating these popular open problems in social choice from the perspective of graph theory.

math.CO · cs.DM