Tight concentration of star saturation number in random graphs
From MaRDI portal
Publication:6172308
DOI10.1016/j.disc.2023.113572zbMath1518.05169arXiv2212.06101OpenAlexW4382361638MaRDI QIDQ6172308
No author found.
Publication date: 19 July 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.06101
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)
Cites Work
- Small maximal matchings in random graphs.
- Star saturation number of random graphs
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- Saturated graphs with minimal number of edges
- On colouring random graphs
- On Pósa's Conjecture for Random Graphs
- The threshold for the square of a Hamilton cycle
- A Problem in Graph Theory
- Saturation in random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Tight concentration of star saturation number in random graphs