The Tur\'{a}n number of book graphs
Jingru Yan, Xingzhi Zhan

TL;DR
This paper determines the Turán numbers for book graphs with specific parameters and characterizes the extremal graphs for these cases, advancing the understanding of graph structures avoiding certain subgraphs.
Contribution
It extends previous work by explicitly calculating Turán numbers for larger graph orders and characterizing extremal graphs for these cases.
Findings
Determined ex(p+4, B_p), ex(p+5, B_p), ex(p+6, B_p).
Characterized extremal graphs for ex(n, B_p) with n=p+2 to p+5.
Builds on classical results by Bollobás and Erdős, and recent work by Qiao and Zhan.
Abstract
Given a graph and a positive integer the Tur\'{a}n number of for the order denoted is the maximum size of a simple graph of order not containing as a subgraph. The book with pages, denoted , is the graph that consists of triangles sharing a common edge. Bollob\'{a}s and Erd\H{o}s initiated the research on the Tur\'{a}n number of book graphs in 1975. The two numbers and have been determined by Qiao and Zhan. In this paper we determine the numbers and and characterize the corresponding extremal graphs for the numbers with
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLanguage, Linguistics, Cultural Analysis
