1964•Colloquium MathematicumOpen access
On an extremal problem in graph theory
Péter L. Erdős
Open full text 675 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Open-access reader
Péter L. Erdős
Abstract
Open-access reader
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 675 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Mathematics, Extremal graph theory, Graph, Discrete mathematics, Combinatorics, Line graph, Voltage graph