Cycle-saturated graphs of minimum size (Q1916094): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00173-t / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2006394242 / rank | |||
Normal rank |
Latest revision as of 09:39, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cycle-saturated graphs of minimum size |
scientific article |
Statements
Cycle-saturated graphs of minimum size (English)
0 references
2 July 1996
0 references
Given a graph \(F\), a graph \(G\) is said to be \(F\)-saturated if \(F \nsubseteq G\) but \(F \subseteq G + e\) for every edge \(e\) in the complement of \(G\). For \(n \geq |V(F) |\), we define \(\text{sat} (n,F)\) to be the smallest size of an \(F\)-saturated graph of order \(n\). The paper presents a series of results that establish bounds on \(\text{sat} (n, C_k)\), where \(C_k\) stands for a cycle of length \(k\). It is shown that with the exceptions of \(k = 8\) and \(k = 10\), we have \(n + c_1 n/k \leq \text{sat} (n, C_k) \leq n + c_2 n/k\). Several more specific results are also presented.
0 references
saturated graphs
0 references
extremal problems
0 references
bounds
0 references
cycle
0 references