Triangle-free subgraphs of powers of cycles (Q1196562): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:30, 5 March 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
