关于赛事结构的一些结果和问题

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2025-02-28 DOI:10.1016/j.jctb.2025.02.002

Tung Nguyen , Alex Scott , Paul Seymour

{"title":"关于赛事结构的一些结果和问题","authors":"Tung Nguyen , Alex Scott , Paul Seymour","doi":"10.1016/j.jctb.2025.02.002","DOIUrl":null,"url":null,"abstract":"<div><div>This paper is a survey of results and problems related to the following question: is it true that if <em>G</em> is a tournament with sufficiently large chromatic number, then <em>G</em> has two vertex-disjoint subtournaments <span><math><mi>A</mi><mo>,</mo><mi>B</mi></math></span>, both with large chromatic number, such that all edges between them are directed from <em>A</em> to <em>B</em>? We describe what we know about this question, and report some progress on several other related questions, on tournament colouring and domination.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"173 ","pages":"Pages 146-183"},"PeriodicalIF":1.2000,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some results and problems on tournament structure\",\"authors\":\"Tung Nguyen , Alex Scott , Paul Seymour\",\"doi\":\"10.1016/j.jctb.2025.02.002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper is a survey of results and problems related to the following question: is it true that if <em>G</em> is a tournament with sufficiently large chromatic number, then <em>G</em> has two vertex-disjoint subtournaments <span><math><mi>A</mi><mo>,</mo><mi>B</mi></math></span>, both with large chromatic number, such that all edges between them are directed from <em>A</em> to <em>B</em>? We describe what we know about this question, and report some progress on several other related questions, on tournament colouring and domination.</div></div>\",\"PeriodicalId\":54865,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series B\",\"volume\":\"173 \",\"pages\":\"Pages 146-183\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series B\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0095895625000097\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series B","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895625000097","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了以下问题的结果和问题：如果G是一个具有足够大色数的锦标赛，那么G是否有两个顶点不相交的子锦标赛a，B，它们都具有较大的色数，并且它们之间的所有边都从a指向B？我们描述了我们对这个问题的了解，并报告了一些其他相关问题的进展，关于比赛的颜色和统治。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some results and problems on tournament structure

This paper is a survey of results and problems related to the following question: is it true that if G is a tournament with sufficiently large chromatic number, then G has two vertex-disjoint subtournaments

A, B

, both with large chromatic number, such that all edges between them are directed from A to B? We describe what we know about this question, and report some progress on several other related questions, on tournament colouring and domination.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.