On the typical structure of graphs not containing a fixed vertex-critical subgraph

DOI10.1002/RSA.21228MaRDI QIDQ6641064

Oren Engelberg, Wojciech Samotij, Lutz Warnke

Publication date: 20 November 2024

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

zbMATH Keywords

asymptotic enumerationthreshold phenomena\(H\)-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The typical structure of graphs with no large cliques
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• For which densities are random triangle-free graphs almost surely bipartite?
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Eine Extremalaufgabe aus der Graphentheorie.
• The typical structure of sparse \(K_{r+1}\)-free graphs
• The typical structure of graphs without given excluded subgraphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Poisson approximation for large deviations
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• Random I‐colorable graphs
• On the asymptotic structure of sparse triangle free graphs
• An efficient container lemma
• On the Number of Graphs Without Large Cliques
• Independent sets in hypergraphs
• On the structure of linear graphs

This page was built for publication: On the typical structure of graphs not containing a fixed vertex-critical subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641064)