This HTML5 document contains 60 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n6http://www.labri.fr/perso/courcell/CoursMaster/
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
dbpedia-ruhttp://ru.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
n19https://www.cs.technion.ac.il/~admlogic/TR/2006/
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Matching_polynomial
rdf:type
dbo:Disease
rdfs:label
Matching polynomial Многочлен паросочетаний
rdfs:comment
Многочлен паросочетаний — производящая функция для числа паросочетаний различных размеров в графе. In the mathematical fields of graph theory and combinatorics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function of the numbers of matchings of various sizes in a graph. It is one of several graph polynomials studied in algebraic graph theory.
dcterms:subject
dbc:Algebraic_graph_theory dbc:Matching_(graph_theory) dbc:Graph_invariants dbc:Polynomials
dbo:wikiPageID
24956783
dbo:wikiPageRevisionID
1093936968
dbo:wikiPageWikiLink
dbr:Hermite_polynomial dbr:Graph_theory dbr:Orthogonal_polynomials dbr:Characteristic_polynomial dbr:Matching_(graph_theory) dbc:Algebraic_graph_theory dbr:Adjacency_matrix dbr:Mathematics dbr:Chemistry dbr:Fibonacci_polynomial dbr:Complete_bipartite_graph dbr:Chebyshev_polynomial dbr:Complete_graph dbr:Fixed-parameter_tractability dbr:Treewidth dbc:Matching_(graph_theory) dbr:Combinatorics dbr:Cycle_(graph_theory) dbr:Rook_polynomial dbr:Generating_function dbr:Forest_(graph_theory) dbr:Algebraic_graph_theory dbr:Laguerre_polynomial dbr:Path_(graph_theory) dbr:Planar_graph dbc:Graph_invariants dbr:Hosoya_index dbr:Sharp-P-complete dbr:Graph_polynomial dbr:Lucas_polynomial dbc:Polynomials dbr:Chemoinformatics dbr:Clique-width dbr:Polynomial_time
dbo:wikiPageExternalLink
n6:CMR-Dam.pdf n19:WG06_makowsky.pdf
owl:sameAs
wikidata:Q6786278 n10:4rVYU dbpedia-ru:Многочлен_паросочетаний freebase:m.09g7zmg
dbp:wikiPageUsesTemplate
dbt:Citation dbt:Harvtxt dbt:Harv
dbo:abstract
In the mathematical fields of graph theory and combinatorics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function of the numbers of matchings of various sizes in a graph. It is one of several graph polynomials studied in algebraic graph theory. Многочлен паросочетаний — производящая функция для числа паросочетаний различных размеров в графе.
gold:hypernym
dbr:Function
prov:wasDerivedFrom
wikipedia-en:Matching_polynomial?oldid=1093936968&ns=0
dbo:wikiPageLength
6929
foaf:isPrimaryTopicOf
wikipedia-en:Matching_polynomial