Name
Abstract | ||
|---|---|---|
For a graph H, the Turan number of H, denoted by ex(n,H), is the maximum number of edges of an n-vertex H-free graph. Let g(n,H) denote the maximum number of edges not contained in any monochromatic copy of H in a 2-edge-coloring of Kn. A wheel Wm is a graph formed by connecting a single vertex to all vertices of a cycle of length m-1. The Turan number of W2k was determined by Simonovits in 1960s. In this paper, we determine ex(n,W2k+1) when n is sufficiently large. We also show that, for sufficient large n, g(n,W2k+1)=ex(n,W2k+1) which confirms a conjecture posed by Keevash and Sudakov for odd wheels. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1002/jgt.22727 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
decomposition family, Turan number, wheels | Journal | 98 |
Issue | ISSN | Citations |
4 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Long-Tu Yuan | 1 | 0 | 0.34 |