arXiv (All)
open access
Saturation numbers of $K_3 \vee P_k$
A graph $G$ is said to be $H$-saturated if $G$ contains no copy of $H$, but $G+e$ contains a copy of $H$ for any edge $e$ of $\overline{G}$. The saturation number of $H$, denoted by $\mathrm{sat}(n, H)$, is the minimum number of edges among all $H$-saturated graphs of order $n$. In this paper, we in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Strong edge coloring of graphs with maximum degree $6$#1119018
- Proper edge colorings of planar graphs with rainbow $C_4$-s#793392
- Proper edge colorings of planar graphs with rainbow $C_4$-s#789388
- Erdős-Gyárfás Balanced Five-Colorings#1389430
- An improved lower bound for the van der Waerden number $w(3,k)$#1115754
Record · ID 1458460
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive