blockversewordysbillionaire.aiyourlistWhiteboardAppquizieunschool

News

Home
Popular
Elections

Genius — OpenServe

Sponsored

Erdős–Stone theorem — latest news, discussion & facts — IJR

Erdős–Stone theorem

Topic

Erdős–Stone theorem

theorem in extremal graph theory

0members1here now

Ask Genius Site

Feed Discussions About

Sort by

Content type

Loading

Latest Erdős–Stone theorem news and discussion

Sort by

Content type

Nothing published yet

The conversation starts anyway — post the first discussion above.

About Erdős–Stone theorem

In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph for a non-complete graph H. It is named after Paul Erdős and Arthur Stone, who proved it in 1946, and it has been described as the “fundamental theorem of extremal graph theory”.

0

members

1

here now

Everything about Erdős–Stone theorem →

Live room · 1 here

Be the first in the room — members see you arrive.

Facts from Wikidata (CC0).

Erdős–Stone theorem across IJR

Ask Genius by OpenServe about Erdős–Stone theorem Create in Studio Build a game Watch videos