On the order of the largest induced tree in a random graph
From MaRDI portal
Publication:1088688
DOI10.1016/0166-218X(86)90021-1zbMath0613.05049MaRDI QIDQ1088688
Zbigniew Palka, Andrzej Ruciński
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
On Induced Paths, Holes, and Trees in Random Graphs, Maximal induces trees in sparse random graphs, MIP formulations for induced graph optimization problems: a tutorial, Induced forests in some distance-regular graphs, Maximum induced forests in random graphs, Dominating and large induced trees in regular graphs, Induced trees in triangle-free graphs, Large induced trees in \(K_r\)-free graphs, Large induced trees in sparse random graphs, Large Induced Matchings in Random Graphs
Cites Work