Jiangdong Ai , Qiming Dai , Qiwen Guo , Yingqi Hu , Changxin Wang
{"title":"A new perspective from hypertournaments to tournaments","authors":"Jiangdong Ai , Qiming Dai , Qiwen Guo , Yingqi Hu , Changxin Wang","doi":"10.1016/j.dam.2024.12.010","DOIUrl":null,"url":null,"abstract":"<div><div>A <span><math><mi>k</mi></math></span>-hypertournament <span><math><mi>H</mi></math></span> on <span><math><mi>n</mi></math></span> vertices is a pair <span><math><mrow><mo>(</mo><mi>V</mi><mo>,</mo><mi>A</mi><mo>)</mo></mrow></math></span> for <span><math><mrow><mn>2</mn><mo>≤</mo><mi>k</mi><mo>≤</mo><mi>n</mi></mrow></math></span>, where <span><math><mrow><mi>V</mi><mrow><mo>(</mo><mi>H</mi><mo>)</mo></mrow></mrow></math></span> is a set of vertices, and <span><math><mrow><mi>A</mi><mrow><mo>(</mo><mi>H</mi><mo>)</mo></mrow></mrow></math></span> is a set of all possible <span><math><mi>k</mi></math></span>-tuples of vertices, such that for any <span><math><mi>k</mi></math></span>-subset <span><math><mi>S</mi></math></span> of <span><math><mi>V</mi></math></span>, <span><math><mrow><mi>A</mi><mrow><mo>(</mo><mi>H</mi><mo>)</mo></mrow></mrow></math></span> contains exactly one of the <span><math><mrow><mi>k</mi><mo>!</mo></mrow></math></span> possible permutations of <span><math><mi>S</mi></math></span>. In this paper, we investigate the relationship between a hyperdigraph and its corresponding normal digraph. Particularly, drawing on a result from Gutin and Yeo (1997), we establish an intrinsic relationship between a strong <span><math><mi>k</mi></math></span>-hypertournament and a strong tournament, which enables us to provide an alternative (more straightforward and concise) proof for some previously known results and get some new results.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"364 ","pages":"Pages 136-142"},"PeriodicalIF":1.0000,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24005286","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
A -hypertournament on vertices is a pair for , where is a set of vertices, and is a set of all possible -tuples of vertices, such that for any -subset of , contains exactly one of the possible permutations of . In this paper, we investigate the relationship between a hyperdigraph and its corresponding normal digraph. Particularly, drawing on a result from Gutin and Yeo (1997), we establish an intrinsic relationship between a strong -hypertournament and a strong tournament, which enables us to provide an alternative (more straightforward and concise) proof for some previously known results and get some new results.
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.