A note on the Turán number of disjoint union of wheels

preprint2020arXivOpen access

Abstract

The Turán number of a graph HH, ex(n,H)\text{ex}(n,H), is the maximum number of edges in a graph on nn vertices which does not have HH as a subgraph. A wheel WnW_n is an nn-vertex graph formed by connecting a single vertex to all vertices of a cycle Cn−1C_{n-1}. Let mW2k+1mW_{2k+1} denote the mm vertex-disjoint copies of W2k+1W_{2k+1}. For sufficiently large nn, we determine the Turán number and all extremal graphs for mW2k+1mW_{2k+1}. We also provide the Turán number and all extremal graphs for Wh:=⋃i=1mWkiW^{h}:=\bigcup\limits^m_{i=1}W_{k_i} when nn is sufficiently large, where the number of even wheels is hh and h>0h>0.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.