The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs (Q2883861): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Cycles of even length in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pentagons vs. triangles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of \(C_ 5's\) in a triangle-free graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548311000629 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066118197 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs |
scientific article |
Statements
The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs (English)
0 references
14 May 2012
0 references
