图兰数字和转换

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2024-10-07 DOI:10.1016/j.disc.2024.114275

Karen Gunderson , Jason Semeraro

{"title":"图兰数字和转换","authors":"Karen Gunderson , Jason Semeraro","doi":"10.1016/j.disc.2024.114275","DOIUrl":null,"url":null,"abstract":"<div><div>Using a switching operation on tournaments we obtain some new lower bounds on the Turán number of the <em>r</em>-graph on <span><math><mi>r</mi><mo>+</mo><mn>1</mn></math></span> vertices with 3 edges. For <span><math><mi>r</mi><mo>=</mo><mn>4</mn></math></span>, extremal examples were constructed using Paley tournaments in previous work. We show that these examples are unique (in a particular sense) using Fourier analysis.</div><div>A 3-tournament is a ‘higher order’ version of a tournament given by an alternating function on triples of distinct vertices in a vertex set. We show that 3-tournaments also enjoy a switching operation and use this to give a formula for the size of a switching class in terms of level permutations, generalising a result of Babai–Cameron.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 2","pages":"Article 114275"},"PeriodicalIF":0.7000,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Turán numbers and switching\",\"authors\":\"Karen Gunderson , Jason Semeraro\",\"doi\":\"10.1016/j.disc.2024.114275\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Using a switching operation on tournaments we obtain some new lower bounds on the Turán number of the <em>r</em>-graph on <span><math><mi>r</mi><mo>+</mo><mn>1</mn></math></span> vertices with 3 edges. For <span><math><mi>r</mi><mo>=</mo><mn>4</mn></math></span>, extremal examples were constructed using Paley tournaments in previous work. We show that these examples are unique (in a particular sense) using Fourier analysis.</div><div>A 3-tournament is a ‘higher order’ version of a tournament given by an alternating function on triples of distinct vertices in a vertex set. We show that 3-tournaments also enjoy a switching operation and use this to give a formula for the size of a switching class in terms of level permutations, generalising a result of Babai–Cameron.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"348 2\",\"pages\":\"Article 114275\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X24004060\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24004060","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

利用锦标赛的切换操作，我们获得了 r+1 个顶点上有 3 条边的 r 图的图兰数的一些新下限。对于 r=4，我们在之前的工作中利用帕利锦标赛构建了极值实例。我们利用傅立叶分析法证明这些例子是唯一的（在特定意义上）。3-锦标赛是锦标赛的 "高阶 "版本，由顶点集合中不同顶点的三元组上的交替函数给出。我们证明了 3 锦标也有切换操作，并利用这一点给出了以水平排列为单位的切换类大小公式，从而推广了巴拜-卡梅隆的一个结果。

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

查看原文本刊更多论文

Turán numbers and switching

Using a switching operation on tournaments we obtain some new lower bounds on the Turán number of the r-graph on

r + 1

vertices with 3 edges. For

r = 4

, extremal examples were constructed using Paley tournaments in previous work. We show that these examples are unique (in a particular sense) using Fourier analysis.

A 3-tournament is a ‘higher order’ version of a tournament given by an alternating function on triples of distinct vertices in a vertex set. We show that 3-tournaments also enjoy a switching operation and use this to give a formula for the size of a switching class in terms of level permutations, generalising a result of Babai–Cameron.

求助全文

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

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.