The asymptotic number of graphs not containing a fixed color-critical subgraph

DOI10.1007/BF01305238zbMath0770.05063OpenAlexW2018472031WikidataQ105583440 ScholiaQ105583440MaRDI QIDQ1204522

Angelika Steger, Hans Jürgen Prömel

Publication date: 10 March 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01305238

zbMATH Keywords

extremal graphasymptotic numbercolor-critical edgeTurán-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (23)

The number of \(C_{2\ell}\)-free graphs ⋮ Reoptimization of Steiner trees: changing the terminal set ⋮ THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS ⋮ Extremal Graph Problems for Graphs with a Color-Critical Vertex ⋮ On the probability of nonexistence in binomial subsets ⋮ The fine structure of octahedron-free graphs ⋮ On Betti numbers of flag complexes with forbidden induced subgraphs ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Almost all triangle-free triple systems are tripartite ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ The typical structure of graphs with no large cliques ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ Excluding induced subgraphs: Critical graphs ⋮ Hereditary properties of hypergraphs ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS ⋮ On the typical structure of graphs in a monotone property ⋮ Asymptotic probabilities of extension properties and random \(l\)-colourable structures ⋮ The number of graphs without forbidden subgraphs ⋮ Estimating parameters associated with monotone properties ⋮ A Limit Law of Almost l-partite Graphs ⋮ Random Ramsey graphs for the four-cycle

Cites Work

• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Asymptotic Enumeration of Partial Orders on a Finite Set
• On the Structure of Edge Graphs

This page was built for publication: The asymptotic number of graphs not containing a fixed color-critical subgraph