Excluding induced subgraphs. II: Extremal graphs
From MaRDI portal
(Redirected from Publication:686271)
Recommendations
Cites work
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- Excluding Induced Subgraphs III: A General Asymptotic
- Excluding induced subgraphs: quadrilaterals
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- On the Erdös-Stone Theorem
- On the chromatic number of random graphs
- On the structure of linear graphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The chromatic number of random graphs
- Über ein Problem von K. Zarankiewicz
Cited in
(37)- Almost all string graphs are intersection graphs of plane convex sets
- 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
- The maximum edit distance from hereditary graph properties
- A note on the bichromatic numbers of graphs
- Stability-type results for hereditary properties
- 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
- Typical structure of hereditary graph families. II: Exotic examples
- The regularity of almost all edge ideals
- On the abstract chromatic number and its computability for finitely axiomatizable theories
- The number of graphs without forbidden subgraphs
- A Brooks-type theorem for the bichromatic number
- Counting \(r\)-graphs without forbidden configurations
- For most graphs H, most H-free graphs have a linear homogeneous set
- scientific article; zbMATH DE number 475587 (Why is no real title available?)
- Induced saturation of graphs
- Almost all string graphs are intersection graphs of plane convex sets
- Excluding Induced Subgraphs III: A General Asymptotic
- Deciding the Bell number for hereditary graph properties
- Excluding a substar and an antisubstar
- On the structure of graphs with low obstacle number
- Measures on monotone properties of graphs
- Boundary properties of factorial classes of graphs
- scientific article; zbMATH DE number 47438 (Why is no real title available?)
- On induced saturation for paths
- Forbidding induced even cycles in a graph: typical structure and counting
- Graphs with large obstacle numbers
- Induced Turán problems and traces of hypergraphs
- The speed of hereditary properties of graphs
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)
