Search for "Hypergraphs" in article titles:

1. Matching in hypergraphs: 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. (Set of hyperedges where every pair is disjoint) [100%] 2023-03-28 [Hypergraphs] [Matching (graph theory)]...
2. Matching in hypergraphs: 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. (Set of hyperedges where every pair is disjoint) [100%] 2024-02-25 [Hypergraphs] [Matching (graph theory)]...
3. Discrepancy of hypergraphs: Discrepancy of hypergraphs is an area of discrepancy theory. In the classical setting, we aim at partitioning the vertices of a hypergraph \displaystyle{ \mathcal{H}=(V, \mathcal{E}) }[/math] into two classes in such a way that ideally each hyperedge ... [100%] 2025-04-13 [Diophantine approximation] [Unsolved problems in mathematics]...
4. Vertex cover in hypergraphs: In graph theory, a vertex cover in a hypergraph is a set of vertices, such that every hyperedge of the hypergraph contains at least one vertex of that set. It is an extension of the notion of vertex cover in ... [86%] 2022-06-09 [Graph theory] [Hypergraphs]...
5. Perfect matching in high-degree hypergraphs: In graph theory, perfect matching in high-degree hypergraphs is a research avenue trying to find sufficient conditions for existence of a perfect matching in a hypergraph, based only on the degree of vertices or subsets of them. In a ... (Area of research in mathematics (graph theory)) [70%] 2023-07-31 [Hypergraphs] [Matching (graph theory)]...