Excluding induced subgraphs. II: Extremal graphs

DOI10.1016/0166-218X(93)90237-IzbMATH Open0783.05064MaRDI QIDQ686271FDOQ686271

Authors: Angelika Steger, Hans Jürgen Prömel 

Publication date: 30 November 1993

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

Recommendations

• Excluding Induced Subgraphs III: A General Asymptotic
• Induced Turán numbers
• scientific article; zbMATH DE number 475587
• Excluding induced subgraphs: critical graphs
• scientific article; zbMATH DE number 47438

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)

Cites Work

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

Cited In (35)

• The edit distance function and symmetrization
• Locally bounded coverings and factorial properties of graphs
• Excluding Subdivisions of Infinite Cliques
• Structure and enumeration theorems for hereditary properties in finite relational languages
• \((k,l)\)-colourings and Ferrers diagram representations of cographs
• Classes of graphs without star forests and related graphs
• Hereditary classes of graphs: a parametric approach
• The structure of almost all graphs in a hereditary property
• For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set
• The maximum edit distance from hereditary graph properties
• A note on the bichromatic numbers of graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• Stability-type results for hereditary properties
• Induced Turán numbers
• The regularity of almost all edge ideals
• On the abstract chromatic number and its computability for finitely axiomatizable theories
• A Brooks-type theorem for the bichromatic number
• The number of graphs without forbidden subgraphs
• Counting \(r\)-graphs without forbidden configurations
• Title not available (Why is that?)
• Induced saturation of graphs
• Deciding the Bell number for hereditary graph properties
• Almost all string graphs are intersection graphs of plane convex sets
• Excluding a substar and an antisubstar
• Measures on monotone properties of graphs
• Boundary properties of factorial classes of graphs
• Title not available (Why is that?)
• On the structure of graphs with low obstacle number
• On induced saturation for paths
• Induced Turán problems and traces of hypergraphs
• Forbidding induced even cycles in a graph: typical structure and counting
• Graphs with large obstacle numbers
• The speed of hereditary properties of graphs
• Almost all string graphs are intersection graphs of plane convex sets

This page was built for publication: Excluding induced subgraphs. II: Extremal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686271)