The planar Turán number of double star S2,4

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2025-05-20 DOI:10.1016/j.disc.2025.114571

Xin Xu, Jiawei Shao

引用次数: 0

Abstract

Planar Turán number

{ex}_{P} (n, H)

of H is the maximum number of edges in an n-vertex planar graph which does not contain H as a subgraph. Ghosh, Győri, Paulos and Xiao initiated the topic of the planar Turán number for double stars. In this paper, we prove that

{ex}_{P} (n, S_{2, 4}) \leq \frac{31}{14} n

for

n \geq 1

, and show that equality holds for infinitely many integers n.

查看原文本刊更多论文

双星S2,4的平面Turán数

平面Turán number exP(n，H) (H)是不包含H的n顶点平面图的最大边数。Ghosh, Győri， Paulos和Xiao发起了平面Turán双星数的课题。本文证明了当n≥1时exP(n,S2,4)≤3114n，并证明了该等式对无穷多个整数n成立。

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

求助全文

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

来源期刊

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.