{ "http://en.wikipedia.org/wiki/Matching_in_hypergraphs" : { "http://xmlns.com/foaf/0.1/primaryTopic" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Matching_in_hypergraphs" : { "http://www.w3.org/2002/07/owl#sameAs" : [ { "type" : "uri", "value" : "http://www.wikidata.org/entity/Q97359334" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } , { "type" : "uri", "value" : "https://global.dbpedia.org/id/DcALf" } ] , "http://www.w3.org/2000/01/rdf-schema#label" : [ { "type" : "literal", "value" : "Matching in hypergraphs" , "lang" : "en" } ] , "http://purl.org/dc/terms/subject" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Matching_(graph_theory)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Hypergraphs" } ] , "http://xmlns.com/foaf/0.1/depiction" : [ { "type" : "uri", "value" : "http://commons.wikimedia.org/wiki/Special:FilePath/Hypergraph_matchings.svg" } ] , "http://www.w3.org/ns/prov#wasDerivedFrom" : [ { "type" : "uri", "value" : "http://en.wikipedia.org/wiki/Matching_in_hypergraphs?oldid=1276472157&ns=0" } ] , "http://xmlns.com/foaf/0.1/isPrimaryTopicOf" : [ { "type" : "uri", "value" : "http://en.wikipedia.org/wiki/Matching_in_hypergraphs" } ] , "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/K\u0151nig's_theorem_(graph_theory)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Edge_coloring" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Vertex_cover_in_hypergraphs" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Hypergraphs" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Polynomial_time" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Fractional_matching" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Hitting_set" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Family_of_sets" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Hypergraph" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Zolt\u00E1n_F\u00FCredi" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Perfect_matching_in_high-degree_hypergraphs" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Set_cover_problem" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Clique_(graph_theory)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Set_packing" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Bipartite_graph" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Hyperedges" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Perfect_matching" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Graph_theory" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Self-loop" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Maximum_cardinality_matching" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Bipartite_hypergraph" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Property_B" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Perfect_graph" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Subset" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/3-dimensional_matching" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/D-interval_hypergraph" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Finite_projective_plane" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Set_(mathematics)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Dirac's_theorem_on_Hamiltonian_cycles" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Erd\u0151s\u2013Ko\u2013Rado_theorem" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Star_(graph_theory)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Disjoint_sets" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Linear_programming_duality" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Vertex_packing" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Vertex_(graph_theory)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/If_and_only_if" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Transversal_(combinatorics)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Helly_property" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Vertex_cover" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Andr\u00E1s_Gy\u00E1rf\u00E1s" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_(graph_theory)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Claude_Berge" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Ryser's_conjecture" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Matching_(graph_theory)" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Rainbow_matching" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Truncated_projective_plane" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Hall-type_theorems_for_hypergraphs" } ] , "http://dbpedia.org/ontology/description" : [ { "type" : "literal", "value" : "set of hyperedges where every pair is disjoint" , "lang" : "en" } ] , "http://dbpedia.org/property/wikiPageUsesTemplate" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Mvar" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Anchor" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Short_description" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Frac" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Sfrac" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Sub" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Sup" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Math" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Abs" } , { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Rp" } ] , "http://dbpedia.org/ontology/thumbnail" : [ { "type" : "uri", "value" : "http://commons.wikimedia.org/wiki/Special:FilePath/Hypergraph_matchings.svg?width=300" } ] } , "http://dbpedia.org/resource/Rainbow-independent_set" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Knaster\u2013Kuratowski\u2013Mazurkiewicz_lemma" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Matching_(graph_theory)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Hall-type_theorems_for_hypergraphs" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Abstract_simplicial_complex" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Sperner's_lemma" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/K\u0151nig's_theorem_(graph_theory)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Zolt\u00E1n_F\u00FCredi" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Maximum_cardinality_matching" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Hypergraph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Vertex_cover_in_hypergraphs" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Perfect_matching_in_high-degree_hypergraphs" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Width_of_a_hypergraph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Balanced_hypergraph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Ryser's_conjecture" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Bipartite_hypergraph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Egalitarian_item_allocation" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/D-interval_hypergraph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Hypergraph_matching" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] , "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Helly_family" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Fractional_matching_in_hypergraphs" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] , "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } , "http://dbpedia.org/resource/Intersecting_hypergraph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] , "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Matching_in_hypergraphs" } ] } }