Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Erdős–Gallai_theorem> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Erdős–Gallai_theorem abstract "The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorial mathematics. It provides one of two known approaches solving the graph realization problem, i.e. it 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 wikiPageExternalLink 1961-05.pdf.
- Erdős–Gallai_theorem wikiPageExternalLink tripathi.ps.
- Erdős–Gallai_theorem wikiPageExternalLink S0012365X02008865.
- Erdős–Gallai_theorem wikiPageID "30208106".
- Erdős–Gallai_theorem wikiPageLength "8672".
- Erdős–Gallai_theorem wikiPageOutDegree "30".
- Erdős–Gallai_theorem wikiPageRevisionID "662941847".
- Erdős–Gallai_theorem wikiPageWikiLink Category:Paul_Erdős.
- Erdős–Gallai_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Erdős–Gallai_theorem wikiPageWikiLink Claude_Berge.
- Erdős–Gallai_theorem wikiPageWikiLink Combinatorics.
- Erdős–Gallai_theorem wikiPageWikiLink Degree_(graph_theory).
- Erdős–Gallai_theorem wikiPageWikiLink Double_counting_(proof_technique).
- Erdős–Gallai_theorem wikiPageWikiLink Elsevier.
- Erdős–Gallai_theorem wikiPageWikiLink Flow_network.
- Erdős–Gallai_theorem wikiPageWikiLink Fulkerson–Chen–Anstee_theorem.
- Erdős–Gallai_theorem wikiPageWikiLink Gale–Ryser_theorem.
- Erdős–Gallai_theorem wikiPageWikiLink Graph_(discrete_mathematics).
- Erdős–Gallai_theorem wikiPageWikiLink Graph_realization_problem.
- Erdős–Gallai_theorem wikiPageWikiLink Graph_theory.
- Erdős–Gallai_theorem wikiPageWikiLink Handshaking_lemma.
- Erdős–Gallai_theorem wikiPageWikiLink Havel–Hakimi_algorithm.
- Erdős–Gallai_theorem wikiPageWikiLink Integer.
- Erdős–Gallai_theorem wikiPageWikiLink Lattice_(order).
- Erdős–Gallai_theorem wikiPageWikiLink Majorization.
- Erdős–Gallai_theorem wikiPageWikiLink Mathematical_induction.
- Erdős–Gallai_theorem wikiPageWikiLink Natural_number.
- Erdős–Gallai_theorem wikiPageWikiLink Partition_(number_theory).
- Erdős–Gallai_theorem wikiPageWikiLink Paul_Erdős.
- Erdős–Gallai_theorem wikiPageWikiLink Prefix_sum.
- Erdős–Gallai_theorem wikiPageWikiLink Sequence.
- Erdős–Gallai_theorem wikiPageWikiLink Seven_Bridges_of_Königsberg.
- Erdős–Gallai_theorem wikiPageWikiLink Tibor_Gallai.
- Erdős–Gallai_theorem wikiPageWikiLinkText "Erdős–Gallai theorem".
- Erdős–Gallai_theorem wikiPageUsesTemplate Template:Citation.
- Erdős–Gallai_theorem wikiPageUsesTemplate Template:Harv.
- Erdős–Gallai_theorem wikiPageUsesTemplate Template:Harvtxt.
- Erdős–Gallai_theorem wikiPageUsesTemplate Template:Reflist.
- Erdős–Gallai_theorem subject Category:Paul_Erdős.
- Erdős–Gallai_theorem subject Category:Theorems_in_graph_theory.
- Erdős–Gallai_theorem hypernym Result.
- Erdős–Gallai_theorem type Diacritic.
- Erdős–Gallai_theorem type Redirect.
- Erdős–Gallai_theorem type Theorem.
- Erdős–Gallai_theorem comment "The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorial mathematics. It provides one of two known approaches solving the graph realization problem, i.e. it 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 sameAs Q5385323.
- Erdős–Gallai_theorem sameAs Stelling_van_Erdős_en_Gallai.
- Erdős–Gallai_theorem sameAs m.0g56swh.
- Erdős–Gallai_theorem sameAs Теорема_Эрдёша_—_Галлаи.
- Erdős–Gallai_theorem sameAs Q5385323.
- Erdős–Gallai_theorem wasDerivedFrom Erdős–Gallai_theorem?oldid=662941847.
- Erdős–Gallai_theorem isPrimaryTopicOf Erdős–Gallai_theorem.