Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora
{"title":"The maximum number of pentagons in a planar graph","authors":"Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora","doi":"10.1002/jgt.23172","DOIUrl":null,"url":null,"abstract":"<p>In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an <span></span><math>\n <semantics>\n <mrow>\n <mi>n</mi>\n </mrow>\n <annotation> $n$</annotation>\n </semantics></math>-vertex planar graph. They precisely determined the maximum number of triangles and four-cycles and presented a conjecture for the maximum number of pentagons. In this work, we confirm their conjecture. Even more, we characterize the <span></span><math>\n <semantics>\n <mrow>\n <mi>n</mi>\n </mrow>\n <annotation> $n$</annotation>\n </semantics></math>-vertex, planar graphs with the maximum number of pentagons.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"229-256"},"PeriodicalIF":0.9000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23172","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an -vertex planar graph. They precisely determined the maximum number of triangles and four-cycles and presented a conjecture for the maximum number of pentagons. In this work, we confirm their conjecture. Even more, we characterize the -vertex, planar graphs with the maximum number of pentagons.
期刊介绍:
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .