Induced forests and trees in Erdős-Rényi random graph

DOI10.1134/S1064562424701886zbMATH Open1543.05163MaRDI QIDQ6575360FDOQ6575360

Authors: Margarita Akhmejanova, Vladimir S. Kozhevnikov 

Publication date: 19 July 2024

Published in: Doklady Mathematics (Search for Journal in Brave)

Recommendations

• Maximum induced forests in random graphs
• The maximum size of an induced forest in the binomial random graph
• Maximum induced trees in sparse random graphs
• Maximum induced subgraphs of the binomial random graph
• Maximum sparse induced subgraphs of the binomial random graph with given number of edges

zbMATH Keywords

treerandom graphinduced subgraphforestErdős-Rényi model

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Cliques in random graphs
• On the independence number of random graphs
• Maximum induced forests in random graphs
• The \(t\)-stability number of a random graph
• Title not available (Why is that?)
• Maximum sparse induced subgraphs of the binomial random graph with given number of edges
• Large induced matchings in random graphs
• The largest hole in sparse random graphs
• Largest sparse subgraphs of random graphs
• On induced paths, holes and trees in random graphs

Cited In (3)

• Maximum induced trees in sparse random graphs
• Maximum induced subgraphs of the binomial random graph
• The maximum size of an induced forest in the binomial random graph

This page was built for publication: Induced forests and trees in Erdős-Rényi random graph

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