arXiv: Combinatorics最新文献_第5页

Counting Numerical Semigroups by Genus and Even Gaps via Kunz-Coordinate Vectors 通过kunz坐标向量用格和偶间隙计数数值半群

arXiv: Combinatorics Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-40822-0_1

Matheus Bernardini

引用次数: 0

arXiv: Combinatorics Pub Date : 2020-06-19 DOI: 10.4310/joc.2021.v12.n2.a5

R. Yuster

{"title":"Dominant tournament families","authors":"R. Yuster","doi":"10.4310/joc.2021.v12.n2.a5","DOIUrl":"https://doi.org/10.4310/joc.2021.v12.n2.a5","url":null,"abstract":"For a tournament $H$ with $h$ vertices, its typical density is $h!2^{-binom{h}{2}}/aut(H)$, i.e. this is the expected density of $H$ in a random tournament. A family ${mathcal F}$ of $h$-vertex tournaments is {em dominant} if for all sufficiently large $n$, there exists an $n$-vertex tournament $G$ such that the density of each element of ${mathcal F}$ in $G$ is larger than its typical density by a constant factor. Characterizing all dominant families is challenging already for small $h$. Here we characterize several large dominant families for every $h$. In particular, we prove the following for all $h$ sufficiently large: (i) For all tournaments $H^*$ with at least $5log h$ vertices, the family of all $h$-vertex tournaments that contain $H^*$ as a subgraph is dominant. (ii) The family of all $h$-vertex tournaments whose minimum feedback arc set size is at most $frac{1}{2}binom{h}{2}-h^{3/2}sqrt{ln h}$ is dominant. For small $h$, we construct a dominant family of $6$ (i.e. $50%$ of the) tournaments on $5$ vertices and dominant families of size larger than $40%$ for $h=6,7,8,9$. For all $h$, we provide an explicit construction of a dominant family which is conjectured to obtain an absolute constant fraction of the tournaments on $h$ vertices. Some additional intriguing open problems are presented.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78866261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A question of Bukh on sums of dilates 关于膨胀和的Bukh问题

arXiv: Combinatorics Pub Date : 2020-06-15 DOI: 10.19086/DA.28143

Brandon Hanson, G. Petridis

引用次数: 1

Counterexamples for Topological Complexity in Digital Images 数字图像拓扑复杂性的反例

arXiv: Combinatorics Pub Date : 2020-06-07 DOI: 10.7251/JIMVI2201103I

M. İs, .Ismet Karaca

引用次数: 3

Line Completion Number of Grid Graph $P_n times P_m$ 网格图的补线数$P_n 乘以P_m$

arXiv: Combinatorics Pub Date : 2020-06-05 DOI: 10.22049/CCO.2021.26884.1156

J. V. Kureethara, Merin Sebastian