On a Turán type problem of Erdős

DOI10.1007/BF01375476zbMath0768.05055OpenAlexW1482178583MaRDI QIDQ1180412

Zoltan Fueredi

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

boundschromatic numberTurán problemproblem of Erdős

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (19)

Many Turán exponents via subdivisions ⋮ Geometric graphs with no self-intersecting path of length three ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ On the Extremal Number of Subdivisions ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ Simplicial homeomorphs and trace-bounded hypergraphs ⋮ The Turán number of blow-ups of trees ⋮ Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ Bipartite Turán problems for ordered graphs ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} ⋮ The Turán number of the grid ⋮ Spectral Turán problems for intersecting even cycles ⋮ On the Turán number of the hypercube ⋮ Compact topological minors in graphs ⋮ More on the extremal number of subdivisions ⋮ Improved bounds for the extremal number of subdivisions ⋮ The extremal number of longer subdivisions ⋮ On the Turán Number of the Blow-Up of the Hexagon

Cites Work

• On some extremal problems in graph theory
• On Graphs that do not Contain a Thomsen Graph
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On a Turán type problem of Erdős