An old problem of Erdős: a graph without two cycles of the same length (Q6162025): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2023.04.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2023.04.013 / rank | |||
Normal rank | |||
Latest revision as of 19:01, 30 December 2024
scientific article; zbMATH DE number 7696110
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An old problem of Erdős: a graph without two cycles of the same length |
scientific article; zbMATH DE number 7696110 |
Statements
An old problem of Erdős: a graph without two cycles of the same length (English)
0 references
15 June 2023
0 references
cycle
0 references
maximum number of edges
0 references
0 references
