Random polynomial graphs for random Turán problems

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2023-08-07 DOI:10.1002/jgt.23015

Sam Spiro

{"title":"Random polynomial graphs for random Turán problems","authors":"Sam Spiro","doi":"10.1002/jgt.23015","DOIUrl":null,"url":null,"abstract":"<p>Bukh and Conlon used random polynomial graphs to give effective lower bounds on <math>\n <semantics>\n <mrow>\n <mtext>ex</mtext>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>n</mi>\n <mo>,</mo>\n <msup>\n <mi>T</mi>\n <mi>ℓ</mi>\n </msup>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $\\text{ex}(n,{{\\mathscr{T}}}^{\\ell })$</annotation>\n </semantics></math>, where <math>\n <semantics>\n <mrow>\n <msup>\n <mi>T</mi>\n <mi>ℓ</mi>\n </msup>\n </mrow>\n <annotation> ${{\\mathscr{T}}}^{\\ell }$</annotation>\n </semantics></math> is the <math>\n <semantics>\n <mrow>\n <mi>ℓ</mi>\n </mrow>\n <annotation> $\\ell $</annotation>\n </semantics></math>th power of a balanced rooted tree <math>\n <semantics>\n <mrow>\n <mi>T</mi>\n </mrow>\n <annotation> $T$</annotation>\n </semantics></math>. We extend their result to give effective lower bounds on <math>\n <semantics>\n <mrow>\n <mtext>ex</mtext>\n <mrow>\n <mo>(</mo>\n <mrow>\n <msub>\n <mi>G</mi>\n <mrow>\n <mi>n</mi>\n <mo>,</mo>\n <mi>p</mi>\n </mrow>\n </msub>\n <mo>,</mo>\n <msup>\n <mi>T</mi>\n <mi>ℓ</mi>\n </msup>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $\\text{ex}({G}_{n,p},{{\\mathscr{T}}}^{\\ell })$</annotation>\n </semantics></math>, which is the maximum number of edges in a <math>\n <semantics>\n <mrow>\n <msup>\n <mi>T</mi>\n <mi>ℓ</mi>\n </msup>\n </mrow>\n <annotation> ${{\\mathscr{T}}}^{\\ell }$</annotation>\n </semantics></math>-free subgraph of the random graph <math>\n <semantics>\n <mrow>\n <msub>\n <mi>G</mi>\n <mrow>\n <mi>n</mi>\n <mo>,</mo>\n <mi>p</mi>\n </mrow>\n </msub>\n </mrow>\n <annotation> ${G}_{n,p}$</annotation>\n </semantics></math>. Analogous bounds for generalized Turán numbers in random graphs are also proven.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"105 2","pages":"192-208"},"PeriodicalIF":0.9000,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23015","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 5

Abstract

Bukh and Conlon used random polynomial graphs to give effective lower bounds on $ex (n, T^{ℓ})$ , where $T^{ℓ}$ is the $ℓ$ th power of a balanced rooted tree $T$ . We extend their result to give effective lower bounds on $ex (G_{n, p}, T^{ℓ})$ , which is the maximum number of edges in a $T^{ℓ}$ -free subgraph of the random graph $G_{n, p}$ . Analogous bounds for generalized Turán numbers in random graphs are also proven.

查看原文本刊更多论文

随机多项式图的随机Turán问题

Bukh和Conlon使用随机多项式图给出了平衡根树的有效下界，其中是平衡根树的次幂。我们扩展了他们的结果，给出了有效的下界，即随机图的一个自由子图的最大边数。也证明了随机图中广义Turán数的类似界。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .