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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
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#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Balanced_hypergraph
rdfs:label
Balanced hypergraph
rdfs:comment
In graph theory, a balanced hypergraph is a hypergraph that has several properties analogous to that of a bipartite graph. Balanced hypergraphs were introduced by Berge as a natural generalization of bipartite graphs. He provided two equivalent definitions.
dct:subject
dbc:Hypergraphs
dbo:wikiPageID
64435862
dbo:wikiPageRevisionID
1032266652
dbo:wikiPageWikiLink
dbc:Hypergraphs dbr:Kőnig's_theorem_(graph_theory) dbr:Edge_coloring dbr:Hypergraph dbr:Hall-type_theorems_for_hypergraphs dbr:Claude_Berge dbr:Hall's_marriage_theorem dbr:Graph_theory dbr:Degree_(graph_theory) dbr:Vertex_cover_in_hypergraphs dbr:Bipartite_graph dbr:Bipartite_hypergraph dbr:Matching_in_hypergraphs
owl:sameAs
wikidata:Q97186440 n13:Cvoo8
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Rp
dbo:abstract
In graph theory, a balanced hypergraph is a hypergraph that has several properties analogous to that of a bipartite graph. Balanced hypergraphs were introduced by Berge as a natural generalization of bipartite graphs. He provided two equivalent definitions.
prov:wasDerivedFrom
wikipedia-en:Balanced_hypergraph?oldid=1032266652&ns=0
dbo:wikiPageLength
9941
foaf:isPrimaryTopicOf
wikipedia-en:Balanced_hypergraph