Maximum induced subgraphs of the binomial random graph

MaRDI QIDQ6621156FDOQ6621156

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)

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Random graphs.
• Random graphs: models and asymptotic characteristics
• On the stability of the independence number of a random subgraph
• Cliques in random graphs
• The distribution of the maximum degree of a random graph
• Title not available (Why is that?)
• On the probability of independent sets in random graphs
• Trees in random graphs
• Largest sparse subgraphs of random graphs
• On induced paths, holes and trees in random graphs
• Title not available (Why is that?)

Cited In (3)

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

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)