Triangle-free subgraphs of powers of cycles (Q1196562): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q583083 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Stephen C. Locke / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3331227 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3679224 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02350629 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1965063833 / rank | |||
Normal rank |
Latest revision as of 11:51, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Triangle-free subgraphs of powers of cycles |
scientific article |
Statements
Triangle-free subgraphs of powers of cycles (English)
0 references
16 January 1993
0 references
Let \(C_{m,n}\) be the \(m\)-th power of an \(n\)-cycle, \(T_{m,n}\) a triangle-free subgraph of \(C_{m,n}\) with maximum number of edges, and \(t_{m,n}=| E(T_{m,n})|\left/|\right.E(C_{m,n})|\). Authors give upper bounds for \(t_{m,n}\) by a linear programming approach, and by applying results on graceful graphs.
0 references
triangle-free graph
0 references
bounds
0 references
graceful graphs
0 references