Excluding induced subgraphs II: extremal graphs
- 1 July 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 44 (1-3) , 283-294
- https://doi.org/10.1016/0166-218x(93)90237-i
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Excluding Induced Subgraphs III: A General AsymptoticRandom Structures & Algorithms, 1992
- Excluding induced subgraphs: quadrilateralsRandom Structures & Algorithms, 1991
- On the chromatic number of random graphsRandom Structures & Algorithms, 1990
- The chromatic number of random graphsCombinatorica, 1988
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponentGraphs and Combinatorics, 1986
- On the Erdös-Stone TheoremJournal of the London Mathematical Society, 1981
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditionsDiscrete Mathematics, 1974
- Über ein Problem von K. ZarankiewiczActa Mathematica Hungarica, 1958
- On the structure of linear graphsBulletin of the American Mathematical Society, 1946