The number of 4-cycles in triangle-free oriented graphs (Q1897447): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On 4‐cycles in random bipartite tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximal number of induced complete bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Distribution of 4-Cycles in Random Bipartite Tournaments / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)00025-e / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035458359 / rank | |||
Normal rank | |||
Latest revision as of 09:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of 4-cycles in triangle-free oriented graphs |
scientific article |
Statements
The number of 4-cycles in triangle-free oriented graphs (English)
0 references
27 August 1995
0 references
oriented 4-cycles
0 references
triangle-free oriented graphs
0 references
extremal graphs
0 references
