Maximum induced trees in sparse random graphs
From MaRDI portal
Publication:6575370
DOI10.1134/S1064562424701989zbMATH Open1544.05097MaRDI QIDQ6575370
Publication date: 19 July 2024
Published in: Doklady Mathematics (Search for Journal in Brave)
Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Density (toughness, etc.) (05C42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Independence numbers of random subgraphs of some distance graph
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- Maximum induced forests in random graphs
- Monadic second-order properties of very sparse random graphs
- Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
- Largest sparse subgraphs of random graphs
- On the sizes of large subgraphs of the binomial random graph
- Cliques in random graphs
- Paths in graphs
- On the probability of independent sets in random graphs
- Random graphs: models and asymptotic characteristics
- Two-Point Concentration of the Independence Number of the Random Graph
This page was built for publication: Maximum induced trees in sparse random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575370)
