Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Erdős–Gallai_theorem> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Erdős–Gallai_theorem abstract "The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorics, that gives a necessary and sufficient condition for a finite sequence of natural numbers to be the degree sequence of a simple graph; a sequence obeying these conditions is called "graphic". The theorem was published in 1960 by Paul Erdős and Tibor Gallai, after whom it is named.".
- Erdős–Gallai_theorem wikiPageID "30208106".
- Erdős–Gallai_theorem wikiPageRevisionID "603464149".
- Erdős–Gallai_theorem subject Category:Paul_Erdős.
- Erdős–Gallai_theorem subject Category:Theorems_in_graph_theory.
- Erdős–Gallai_theorem comment "The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorics, that gives a necessary and sufficient condition for a finite sequence of natural numbers to be the degree sequence of a simple graph; a sequence obeying these conditions is called "graphic". The theorem was published in 1960 by Paul Erdős and Tibor Gallai, after whom it is named.".
- Erdős–Gallai_theorem label "Erdős–Gallai theorem".
- Erdős–Gallai_theorem label "Stelling van Erdős en Gallai".
- Erdős–Gallai_theorem label "Теорема Эрдёша — Галлаи".
- Erdős–Gallai_theorem sameAs Erd%C5%91s%E2%80%93Gallai_theorem.
- Erdős–Gallai_theorem sameAs Stelling_van_Erdős_en_Gallai.
- Erdős–Gallai_theorem sameAs Q5385323.
- Erdős–Gallai_theorem sameAs Q5385323.
- Erdős–Gallai_theorem wasDerivedFrom Erdős–Gallai_theorem?oldid=603464149.