Ervin Győri , Binlong Li , Nika Salia , Casey Tompkins
{"title":"关于生成树通用图的说明","authors":"Ervin Győri , Binlong Li , Nika Salia , Casey Tompkins","doi":"10.1016/j.dam.2024.11.008","DOIUrl":null,"url":null,"abstract":"<div><div>Chung and Graham considered the problem of minimizing the number of edges in an <span><math><mi>n</mi></math></span>-vertex graph containing all <span><math><mi>n</mi></math></span>-vertex trees as a subgraph. They showed that such a graph has at least <span><math><mrow><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mi>n</mi><mo>log</mo><mi>n</mi></mrow></math></span> edges. In this note, we improve this lower estimate to <span><math><mrow><mi>n</mi><mo>log</mo><mi>n</mi><mo>−</mo><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"362 ","pages":"Pages 146-147"},"PeriodicalIF":1.0000,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on universal graphs for spanning trees\",\"authors\":\"Ervin Győri , Binlong Li , Nika Salia , Casey Tompkins\",\"doi\":\"10.1016/j.dam.2024.11.008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Chung and Graham considered the problem of minimizing the number of edges in an <span><math><mi>n</mi></math></span>-vertex graph containing all <span><math><mi>n</mi></math></span>-vertex trees as a subgraph. They showed that such a graph has at least <span><math><mrow><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mi>n</mi><mo>log</mo><mi>n</mi></mrow></math></span> edges. In this note, we improve this lower estimate to <span><math><mrow><mi>n</mi><mo>log</mo><mi>n</mi><mo>−</mo><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"362 \",\"pages\":\"Pages 146-147\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X24004803\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004803","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
摘要
Chung 和 Graham 考虑了在包含所有 n 个顶点的树作为子图的 n 个顶点图中尽量减少边数的问题。他们的研究表明，这样的图至少有 12nlogn 条边。在本说明中，我们将这一较低估计值改进为 nlogn-O(n)。
Chung and Graham considered the problem of minimizing the number of edges in an -vertex graph containing all -vertex trees as a subgraph. They showed that such a graph has at least edges. In this note, we improve this lower estimate to .
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
