Egy gráfelméleti szélsőértékfeladatról

Turán, P. (1941). Egy gráfelméleti szélsőértékfeladatról. Matematikai és Fizikai Lapok.

Type

Journal article

Intellectual base

Primary research

Year

1941

Link

https://fanchung.ucsd.edu/erdosprb/erdos/newproblems/HypergraphTuran.html

Cited by

1 citation across 1 artifact.

Domain-specific

• Turán Graph
  • Turán's theorem says more: among every simple graph on (n) vertices with no (K_{r+1}), (T(n,r)) has the largest possible number of edges, and it is the unique maximizer up to graph isomorphism.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:b09a2de0ce9c · see in the full table