Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2503.03487

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2503.03487 (math)
[Submitted on 5 Mar 2025 (v1) , last revised 29 Jun 2025 (this version, v3)]

Title: The planar Turan number of double star S_(3,5)

Title: 平面图的Turán数双星S_(3,5)

Authors:Dandan Liu, Shoujun Xu
Abstract: Given a graph H and a positive integer n, the planar Turan number of H, denoted by exp(n, H), is the maximum number of edges in an n-vertex H-free planar graph.D.Ghosh, et al.initiated the topic of double stars S_(k,l). Recently Xu et al.[AIMS Mathematics, 2025, 10(1): 1628-1644.] mentioned that exp(n, S_(3,5)) is still unknown.In this paper, we first establish that the planar Turan number S_(3,5) satisfies exp(n, S_(3,5)) <= 23n/8 - 9/2 for all n >= 2. The upper bound is tight for n = 12.
Abstract: 给定一个图H和一个正整数n,H的平面Turán数,记为exp(n, H),是在n顶点的H-自由平面图中边的最大数量。D.Ghosh等人开启了双星S_(k,l)的研究。最近Xu等人[AIMS Mathematics, 2025, 10(1): 1628-1644.]提到exp(n, S_(3,5))仍然是未知的。在本文中,我们首先建立平面Turán数S_(3,5)满足exp(n, S_(3,5)) <= 23n/8 - 9/2对于所有n >= 2。当n = 12时,该上界是紧的。
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2503.03487 [math.CO]
  (or arXiv:2503.03487v3 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2503.03487
arXiv-issued DOI via DataCite

Submission history

From: Dandan Liu [view email]
[v1] Wed, 5 Mar 2025 13:25:04 UTC (2,973 KB)
[v2] Mon, 23 Jun 2025 15:30:00 UTC (3,884 KB)
[v3] Sun, 29 Jun 2025 10:08:27 UTC (6,779 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2025-03
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号