An extremal graph problem

DOI10.1007/BF01896420zbMath0234.05118OpenAlexW1986233232WikidataQ105997988 ScholiaQ105997988MaRDI QIDQ5642586

Miklós Simmonovits

Publication date: 1972

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01896420

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (13)

A problem of Erdős and Sós on 3-graphs ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ Extremal Graph Problems for Graphs with a Color-Critical Vertex ⋮ The flag upper bound theorem for 3- and 5-manifolds ⋮ The extremal graph problem of the icosahedron ⋮ Extremal graphs for odd wheels ⋮ The fine structure of octahedron-free graphs ⋮ On the Turán number of the hypercube ⋮ On the combinatorial problems which I would most like to see solved ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions ⋮ Measures on monotone properties of graphs ⋮ A linear hypergraph extension of Turán's theorem

Cites Work

• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extremal graph problem