On the Turán Number of Edge Blow-Ups of Cliques

IF 0.9 3区数学 Q2 MATHEMATICS

SIAM Journal on Discrete Mathematics Pub Date : 2024-09-13 DOI:10.1137/23m1623240

Jialei Song, Changhong Lu, Long-Tu Yuan

引用次数: 0

Abstract

SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2429-2446, September 2024.
Abstract. The [math]-blow-up of a given graph is obtained by replacing each edge by a clique of order [math] where the new vertices of the cliques are distinct. Liu and Yuan determined the extremal graphs for the 3-blow-ups of a triangle and the [math]-blow-ups of any complete graph with order at most [math], respectively. We determine the Turán number for the [math]-blow-ups of a complete graph with order at least [math], completing the study of the extremal graphs for [math]-blow-ups of complete graphs.

查看原文本刊更多论文

论小块边缘炸裂的图兰数

SIAM 离散数学杂志》，第 38 卷第 3 期，第 2429-2446 页，2024 年 9 月。摘要。一个给定图的[math]-blow-up 是通过用一个秩为[math]的小群替换每条边而得到的，其中小群的新顶点是不同的。刘和元分别确定了三角形的 3 次炸裂和任何完整图的[math]次炸裂的极值图，其阶最多为[math]。我们确定了阶数至少为 [math] 的完整图的 [math]-blow-up 的图兰数，从而完成了对完整图的 [math]-blow-up 的极值图的研究。

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

求助全文

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

来源期刊

SIAM Journal on Discrete Mathematics 数学-应用数学

CiteScore

1.90

自引率

0.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.