Forbidden subgraphs in connected graphs

DOI10.1016/j.tcs.2003.11.024zbMath1052.05036arXivcs/0411093OpenAlexW2039945037MaRDI QIDQ1884919

Vlady Ravelomanana, Loÿs Thimonier

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0411093

zbMATH Keywords

random graphsasymptotic enumerationforbidden subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (4)

Random 2 XORSAT phase transition ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ Random 2-XORSAT at the Satisfiability Threshold ⋮ Asymptotic enumeration of sparse 2-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The numbers of labeled colored and chromatic trees
• The first cycles in an evolving graph
• The Brownian excursion area: A numerical analysis
• Conditional limit theorems for branching processes
• On the analysis of linear probing hashing
• A calculus for the random generation of labelled combinatorial structures
• The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
• The enumeration of labeled graphs by number of cutpoints
• On a probability problem connected with railway traffic
• The number of connected sparsely edged graphs. III. Asymptotic results
• Kac's formula, levy's local time and brownian excursion
• Singularity Analysis of Generating Functions
• A Recurrence Related to Trees
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• Asymptotic properties of labeled connected graphs
• Asymptotic Methods in Enumeration
• The number of connected sparsely edged graphs
• The number of connected sparsely edged graphs. II. Smooth graphs and blocks
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• The shrinking-and-expanding method for the graph enumeration
• The birth of the giant component

This page was built for publication: Forbidden subgraphs in connected graphs