Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-18T16:41:51.208Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Maximum Number of Triangles in Wheel-Free Graphs

Published online by Cambridge University Press:  12 September 2008

Zoltán Füredi ,
Michel X. Goemans  and
Daniel J. Kleitman
Zoltán Füredi
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139
Michel X. Goemans
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139
Daniel J. Kleitman
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139
Get access Rights & Permissions [Opens in a new window]

Abstract

Gallai [1] raised the question of determining t(n), the maximum number of triangles in graphs of n vertices with acyclic neighborhoods. Here we disprove his conjecture (t(n) ~ n2/8) by exhibiting graphs having n2/7.5 triangles. We improve the upper bound [11] of (n2 − n)/6 to t(n) ≤; n2/7.02 + O(n). For regular graphs, we further decrease this bound to n2/7.75 + O(n).

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 3 , Issue 1 , March 1994 , pp. 63 - 75
Copyright
Copyright © Cambridge University Press 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Erdős, P. (1988) Problems and results in combinatorial analysis and graph theory. Discrete Math., 72 81–92.Google Scholar
[2]Erdős, P. (1965) Extremal problems in graph theory. In: Fiedler, M. (ed.) Theory of Graphs and its Appl., (Proc. Symp. Smolenice, 1963), Academic Press, New York29–36.Google Scholar
[3]Erdős, P. and Simonovits, M. (1966) A limit theorem in graph theory. Studia Sci. Math. Hungar. 1 51–57.Google Scholar
[4]Frankl, P. and Rödl, V. (1988) Some Ramsey-Turán type results for hypergraphs. Combinatorica 8 323–332.Google Scholar
[5]Fronček, D. (1990) On one problem of B. Zelinka (manuscript).Google Scholar
[6]Golberg, A. I. and Gurvich, V. A. (1987) On the maximum number of edges for a graph with n vertices in which every subgraph with k vertices has at most t edges. Soviet Math. Doklady 35 255–260.Google Scholar
[7]Griggs, J. R., Simonovits, M. and Thomas, G. R. (1993) Maximum size graphs in which every fe-subgraph is missing several edges (manuscript).Google Scholar
[8]Haxell, P. (1993) PhD Thesis, University of Cambridge, Cambridge, England.Google Scholar
[9]Sós, V. T., Erdős, P. and Brown, W. G. (1973) On the existence of triangulated spheres in 3-graphs, and related problems. Periodica Math. Hungar. 3 221–228.Google Scholar
[10]Zelinka, B. (1983) Locally tree-like graphs. Čas. pěst. mat. 108 230–238.Google Scholar
[11]Zhou, B. (to appear) A counter example to a conjecture of Gallai. Discrete Math.Google Scholar