Extremal graphs for odd wheels

DOI10.1002/jgt.22727zbMath1522.05233arXiv2001.02628OpenAlexW3191664167MaRDI QIDQ6056767

No author found.

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.02628

zbMATH Keywords

Turán numberwheelsdecomposition family

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Extremal combinatorics (05D99)

Related Items (4)

Extremal graphs for edge blow-up of graphs ⋮ On the Turán number of \(K_m \vee C_{2k-1}\) ⋮ The Turán number for the edge blow-up of trees: the missing case ⋮ Planar Turán number of intersecting triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On edges not in monochromatic copies of a fixed bipartite graph
• The extremal graph problem of the icosahedron
• Extremal graphs for intersecting cliques
• On the number of edges not covered by monochromatic copies of a fixed graph.
• Turán numbers for odd wheels
• Edges not in any monochromatic copy of a fixed graph
• Stability theorems for cancellative hypergraphs
• Extremal graphs for intersecting triangles
• Extremal graphs for blow-ups of cycles and trees
• A note on the Turán number of disjoint union of wheels
• Turán number of disjoint triangles in 4-partite graphs
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Extremal graphs for edge blow-up of graphs
• On maximal paths and circuits of graphs
• Extremal graphs for the k‐flower
• An extremal graph problem
• On a problem of K. Zarankiewicz
• On the structure of linear graphs

This page was built for publication: Extremal graphs for odd wheels