Excluding Induced Subgraphs III: A General Asymptotic

DOI10.1002/rsa.3240030104zbMath0751.05041OpenAlexW2145702572MaRDI QIDQ3989739

Angelika Steger, Hans Jürgen Prömel

Publication date: 28 June 1992

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240030104

zbMATH Keywords

induced subgraphextremal graph\(H\)-free graphsasymptotic properties of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (46)

A remark on the number of edge colorings of graphs ⋮ Regularity Lemma for k-uniform hypergraphs ⋮ Perfect Graphs of Fixed Density: Counting and Homogeneous Sets ⋮ On the Boolean dimension of spherical orders ⋮ Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ The number of partial orders of fixed width ⋮ Almost all Berge Graphs are Perfect ⋮ 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 ⋮ Supersaturation for hereditary properties ⋮ Locally bounded coverings and factorial properties of graphs ⋮ The regularity of almost all edge ideals ⋮ The structure of almost all graphs in a hereditary property ⋮ Shadows of ordered graphs ⋮ Simple Containers for Simple Hypergraphs ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours ⋮ On the structure of graphs with low obstacle number ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The maximum edit distance from hereditary graph properties ⋮ Hypergraph containers ⋮ Induced Turán Numbers ⋮ Forbidding induced even cycles in a graph: typical structure and counting ⋮ Excluding induced subgraphs. II: Extremal graphs ⋮ Definability of Combinatorial Functions and Their Linear Recurrence Relations ⋮ Unnamed Item ⋮ The structure and the number of \(P_7\)-free bipartite graphs ⋮ Graphs with Large Obstacle Numbers ⋮ Measures on monotone properties of graphs ⋮ Forbidden induced bipartite graphs ⋮ The structure and the number of \(P_7\)-free bipartite graphs ⋮ Deciding the Bell Number for Hereditary Graph Properties ⋮ Excluding induced subgraphs: Critical graphs ⋮ Hereditary properties of hypergraphs ⋮ Boundary Properties of Factorial Classes of Graphs ⋮ The number of graphs without forbidden subgraphs ⋮ Stability‐type results for hereditary properties ⋮ A note on counting orientations ⋮ Almost All Friendly Matrices Have Many Obstructions ⋮ Forbidden induced partial orders ⋮ 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 ⋮ The Ramsey number for hypergraph cycles. I.

Cites Work

• Regularity lemmas for hypergraphs and quasi-randomness

This page was built for publication: Excluding Induced Subgraphs III: A General Asymptotic