Excluding induced subgraphs. II: Extremal graphs

DOI10.1016/0166-218X(93)90237-IzbMath0783.05064MaRDI QIDQ686271

Angelika Steger, Hans Jürgen Prömel

Publication date: 30 November 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberextremal graphclique covering numberTuran graphweak subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items

A Brooks‐Type Theorem for the Bichromatic Number, For most graphs H , most H -free graphs have a linear homogeneous set, Counting \(r\)-graphs without forbidden configurations, The edit distance function and symmetrization, Classes of graphs without star forests and related graphs, Almost all string graphs are intersection graphs of plane convex sets, Locally bounded coverings and factorial properties of graphs, Induced Turán problems and traces of hypergraphs, The regularity of almost all edge ideals, The structure of almost all graphs in a hereditary property, Structure and enumeration theorems for hereditary properties in finite relational languages, Induced saturation of graphs, On the structure of graphs with low obstacle number, On induced saturation for paths, \((k,l)\)-colourings and Ferrers diagram representations of cographs, The maximum edit distance from hereditary graph properties, Induced Turán Numbers, Forbidding induced even cycles in a graph: typical structure and counting, The structure and the number of \(P_7\)-free bipartite graphs, Graphs with Large Obstacle Numbers, Measures on monotone properties of graphs, A note on the bichromatic numbers of graphs, The structure and the number of \(P_7\)-free bipartite graphs, Deciding the Bell Number for Hereditary Graph Properties, Boundary Properties of Factorial Classes of Graphs, The number of graphs without forbidden subgraphs, Stability‐type results for hereditary properties, The speed of hereditary properties of graphs, Hereditary classes of graphs: a parametric approach, Almost all string graphs are intersection graphs of plane convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Über ein Problem von K. Zarankiewicz
• On the Erdös-Stone Theorem
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• On the structure of linear graphs
• The chromatic number of random graphs
• On the chromatic number of random graphs