关于生成树通用图的说明

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2024-11-23 DOI:10.1016/j.dam.2024.11.008

Ervin Győri , Binlong Li , Nika Salia , Casey Tompkins

引用次数: 0

摘要

Chung 和 Graham 考虑了在包含所有 n 个顶点的树作为子图的 n 个顶点图中尽量减少边数的问题。他们的研究表明，这样的图至少有 12nlogn 条边。在本说明中，我们将这一较低估计值改进为 nlogn-O(n)。

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

查看原文本刊更多论文

A note on universal graphs for spanning trees

Chung and Graham considered the problem of minimizing the number of edges in an

n

-vertex graph containing all

n

-vertex trees as a subgraph. They showed that such a graph has at least

\frac{1}{2} n log n

edges. In this note, we improve this lower estimate to

n log n - O (n)

求助全文

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

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.