Excluding induced subgraphs. II: Extremal graphs
From MaRDI portal
Publication:686271
DOI10.1016/0166-218X(93)90237-IzbMath0783.05064MaRDI QIDQ686271
Hans Jürgen Prömel, Angelika Steger
Publication date: 30 November 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C55: Generalized Ramsey theory
Related Items
Measures on monotone properties of graphs, The maximum edit distance from hereditary graph properties, The number of graphs without forbidden subgraphs, The speed of hereditary properties of graphs, Stability‐type results for hereditary properties
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