Maximum induced subgraphs of the binomial random graph

MaRDI QIDQ6621156zbMATH OpenFDO

Authors József Balogh, M. E. Zhukovskii

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35)

Recommendations

• Maximum sparse induced subgraphs of the binomial random graph with given number of edges
• Maximum induced trees in sparse random graphs
• On the sizes of large subgraphs of the binomial random graph
• Induced forests and trees in Erdős-Rényi random graph
• The maximum size of an induced forest in the binomial random graph

Cites work

• scientific article; zbMATH DE number 3943864 (Why is no real title available?)
• scientific article; zbMATH DE number 4087713 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Cliques in random graphs
• Largest sparse subgraphs of random graphs
• On induced paths, holes and trees in random graphs
• On the probability of independent sets in random graphs
• On the stability of the independence number of a random subgraph
• Random graphs.
• Random graphs: models and asymptotic characteristics
• The distribution of the maximum degree of a random graph
• Trees in random graphs

Cited in

(3)

• The maximum size of an induced forest in the binomial random graph
• Induced forests and trees in Erdős-Rényi random graph
• Maximum induced trees in sparse random graphs

This page was built for publication: Maximum induced subgraphs of the binomial random graph

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