Excluding induced subgraphs: quadrilaterals

DOI10.1002/RSA.3240020106zbMATH Open0763.05046OpenAlexW2106491342MaRDI QIDQ3970902FDOQ3970902

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

Publication date: 25 June 1992

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

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

Recommendations

• Excluding Induced Subgraphs III: A General Asymptotic
• Forbidding induced even cycles in a graph: typical structure and counting
• The structure of graphs with forbidden induced \(C_4\), \(\overline{C}_4\), \(C_5\), \(S_3\), chair and co-chair
• On the structure of clique-free graphs

zbMATH Keywords

quadrilateralbipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Cites Work

• Asymptotic Enumeration of Partial Orders on a Finite Set
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Graphs without quadrilaterals

Cited In (27)

• The edit distance function and symmetrization
• Locally bounded coverings and factorial properties of graphs
• Structure and enumeration theorems for hereditary properties in finite relational languages
• Excluding induced subgraphs. II: Extremal graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• 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
• The maximum edit distance from hereditary graph properties
• The structure of typical eye-free graphs and a Turán-type result for two weighted colours
• Hereditary properties of hypergraphs
• The structure and the number of \(P_7\)-free bipartite graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• Induced Turán numbers
• Almost all Berge Graphs are Perfect
• Counting \(r\)-graphs without forbidden configurations
• Deciding the Bell number for hereditary graph properties
• Almost all string graphs are intersection graphs of plane convex sets
• The structure of graphs with forbidden induced \(C_4\), \(\overline{C}_4\), \(C_5\), \(S_3\), chair and co-chair
• Measures on monotone properties of graphs
• Boundary properties of factorial classes of graphs
• Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets
• On the structure of graphs with low obstacle number
• Forbidding induced even cycles in a graph: typical structure and counting
• Graphs with large obstacle numbers
• The speed of hereditary properties of graphs
• Perfect graphs of fixed density: counting and homogeneous sets

This page was built for publication: Excluding induced subgraphs: quadrilaterals

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