Maximum induced forests in random graphs

DOI10.1016/J.DAM.2021.08.018zbMath1477.05172arXiv2101.08190OpenAlexW3204774295MaRDI QIDQ2235276

Yanyan Li

Publication date: 21 October 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphinduced treeconcentrationinduced forest

Mathematics Subject Classification ID

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

Related Items (2)

MIP formulations for induced graph optimization problems: a tutorial ⋮ Induced forests in some distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the order of the largest induced tree in a random graph
• Maximal induces trees in sparse random graphs
• Maximum sparse induced subgraphs of the binomial random graph with given number of edges
• Amazing and Aesthetic Aspects of Analysis
• A Remark on Stirling's Formula
• On colouring random graphs
• Cliques in random graphs
• On Induced Paths, Holes and Trees in Random Graphs

This page was built for publication: Maximum induced forests in random graphs