On the Maximum Number of Triangles in Wheel-Free Graphs

DOI10.1017/S0963548300000985zbMath0808.05062OpenAlexW2064398292MaRDI QIDQ4306433

Michel X. Goemans, Daniel J. Kleitman, Zoltan Fueredi

Publication date: 9 March 1995

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000985

zbMATH Keywords

regular graphstrianglesneighborhoodswheel-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

Turán problems for integer-weighted graphs

Cites Work

• Some Ramsey-Turán type results for hypergraphs
• Problems and results in combinatorial analysis and graph theory
• On the existence of triangulated spheres in 3-graphs, and related problems

This page was built for publication: On the Maximum Number of Triangles in Wheel-Free Graphs