Extremal Graphs without Large Forbidden Subgraphs
From MaRDI portal
Publication:4154888
DOI10.1016/S0167-5060(08)70495-3zbMath0375.05034OpenAlexW1987001420WikidataQ105998124 ScholiaQ105998124MaRDI QIDQ4154888
Béla Bollobás, Endre Szemerédi, Miklós Simmonovits, Paul Erdős
Publication date: 1978
Published in: Advances in Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70495-3
Related Items
Degrees of nonlinearity in forbidden 0-1 matrix problems, Generating all subsets of a finite set with disjoint unions, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Testing subgraphs in directed graphs, The number of graphs without forbidden subgraphs, Subdivisions of transitive tournaments, On graphs with small subgraphs of large chromatic number
