About: Matching in hypergraphs

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Matching in hypergraphs Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/AGn2ZukXaX

In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph.

Attributes	Values
rdfs:label	Matching in hypergraphs (en)
rdfs:comment	In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph. (en)
dcterms:subject	Matching (graph theory) Hypergraphs
Wikipage page ID	63030703 (xsd:integer)
Wikipage revision ID	1114776161 (xsd:integer)
Link from a Wikipage to another Wikipage	András Gyárfás Perfect matching Perfect matching in high-degree hypergraphs D-interval hypergraph Vertex cover Vertex cover in hypergraphs Kőnig's theorem (graph theory) Matching (graph theory) Matching (graph theory) Matching in hypergraphs Maximum cardinality matching Claude Berge Zoltán Füredi Star (graph theory) Clique (graph theory) Perfect graph Disjoint sets 3-dimensional matching Edge coloring Erdős–Ko–Rado theorem Family of sets Fractional matching Graph theory Hitting set Hall-type theorems for hypergraphs Hypergraph Bipartite graph Bipartite hypergraph Transversal (combinatorics) Hypergraphs Polynomial time If and only if Rainbow matching Set (mathematics) Set cover problem Vertex (graph theory) Dirac's theorem on Hamiltonian cycles Property B Set packing Subset Ryser's conjecture Truncated projective plane Linear programming duality Finite projective plane Helly property Hyperedges Vertex packing Self-loop
sameAs	Matching in hypergraphs Matching in hypergraphs
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Frac dbt:Math dbt:Mvar dbt:Rp dbt:Sfrac dbt:Short_description dbt:Sub dbt:Sup dbt:Abs
has abstract	In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph. (en)
prov:wasDerivedFrom	wikipedia-en:Matching_in_hypergraphs?oldid=1114776161&ns=0
page length (characters) of wiki page	19169 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Matching_in_hypergraphs
is Link from a Wikipage to another Wikipage of	Perfect matching in high-degree hypergraphs D-interval hypergraph Vertex cover in hypergraphs Kőnig's theorem (graph theory) Matching (graph theory) Matching in hypergraphs Maximum cardinality matching Egalitarian item allocation Zoltán Füredi Helly family Abstract simplicial complex Balanced hypergraph Hall-type theorems for hypergraphs Hypergraph Bipartite hypergraph Width of a hypergraph Sperner's lemma Hypergraph matching Rainbow-independent set Knaster–Kuratowski–Mazurkiewicz lemma Ryser's conjecture Intersecting hypergraph Fractional matching in hypergraphs
is Wikipage redirect of	Hypergraph matching Intersecting hypergraph Fractional matching in hypergraphs
is foaf:primaryTopic of	wikipedia-en:Matching_in_hypergraphs

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 55 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software