On the Thickness of Sparse Random Graphs

DOI10.1017/S0963548300000353MaRDI QIDQ4291190zbMATH OpenOpenAlexFDO

Authors Colin Cooper

Publication date 5 May 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300000353

zbMATH Keywords

arboricitythicknesssparse random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The diameter of sparse random graphs
• Random Subgraphs in Sparse Graphs
• Spanning subgraphs of random graphs
• On the thickness and arboricity of a graph
• scientific article; zbMATH DE number 3895112

Cites work

• Almost all graphs with 1.44n edges are 3-colorable
• Decomposition of Finite Graphs Into Forests
• Edge disjoint spanning trees in random graphs
• On tree census and the giant component in sparse random graphs

Cited in

(2)

• A simulated annealing algorithm for determining the thickness of a graph
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities

This page was built for publication: On the Thickness of Sparse Random Graphs

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