Maximum sparse induced subgraphs of the binomial random graph with given number of edges
From MaRDI portal
Publication:2214056
DOI10.1016/j.disc.2020.112205zbMath1454.05111arXiv1910.09044OpenAlexW3096666741MaRDI QIDQ2214056
Dmitry Kamaldinov, Arkadiy Skorkin, M. E. Zhukovskii
Publication date: 4 December 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.09044
Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)
Related Items
Cycle Saturation in Random Graphs ⋮ Tight concentration of star saturation number in random graphs ⋮ Maximum induced forests in random graphs
Cites Work
- Unnamed Item
- On the stability of the independence number of a random subgraph
- On the distribution of the maximum \(k\)-degrees of the binomial random graph
- Independence numbers of random subgraphs of some distance graph
- Largest sparse subgraphs of random graphs
- On colouring random graphs
- Cliques in random graphs
- Paths in graphs
- On Induced Paths, Holes and Trees in Random Graphs
- Random graphs: models and asymptotic characteristics