Abstract
The Turán number of a graph , , is the maximum number of edges in a graph on vertices which does not have as a subgraph. A wheel is an -vertex graph formed by connecting a single vertex to all vertices of a cycle . Let denote the vertex-disjoint copies of . For sufficiently large , we determine the Turán number and all extremal graphs for . We also provide the Turán number and all extremal graphs for when is sufficiently large, where the number of even wheels is and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.