graph theory, a balanced hypergraph is a hypergraph that has several properties analogous to that of a bipartite graph. Balanced hypergraphs were introduced...

In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge...

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 graph theory, the term bipartite hypergraph describes several related classes of hypergraphs, all of which are natural generalizations of a bipartite...

theory, Hall-type theorems for hypergraphs are several generalizations of Hall's marriage theorem from graphs to hypergraphs. Such theorems were proved by...

The method of (hypergraph) containers is a powerful tool that can help characterize the typical structure and/or answer extremal questions about families...

plane (TPP), also known as a dual affine plane, is a special kind of a hypergraph or geometric configuration that is constructed in the following way. Take...

model a hypergraph in which U is the set of vertices of the hypergraph, V is the set of hyperedges, and E contains an edge from a hypergraph vertex v...

as Zoltan by Devine et al. focus on hypergraph partitioning. Andreev, Konstantin; Räcke, Harald (2004). "Balanced graph partitioning". Proceedings of...

contrast, a hypergraph can have multiple vertices assigned to one edge; thus, a general matrix of non-negative integers describes a hypergraph. The incidence...

networks Fractional stable paths problems Fractional hypergraph matching (see also the NP-complete Hypergraph matching) Fractional strong kernel Scarf's lemma...

Directed acyclic graph Propositional directed acyclic graph Multigraph Hypergraph Lightmap Winged edge Quad-edge Routing table Symbol table Piece table...

the order 2 biplane (a symmetric (7,4,2)-design). Algebraic statistics Hypergraph Williamson conjecture Stinson 2003, pg.1 Hayashi, Takao (2008). "Magic...

hypergraph, the tentacles carry labels which are determined by the hyperedge's label. A conventional directed graph can be thought of as a hypergraph...

primality test balanced binary search tree balanced binary tree balanced k-way merge sort balanced merge sort balanced multiway merge balanced multiway tree...

2}, {2,3}, {1}} is balanced: choose w 1 , 2 = 0 , w 2 , 3 = 1 , w 1 = 1 {\displaystyle w_{1,2}=0,w_{2,3}=1,w_{1}=1} . In hypergraph terminology, a collection...

a selection: Brouwer, Andries E., and Antoon WJ Kolen. "A super-balanced hypergraph has a nest point." Stichting Mathematisch Centrum. Zuivere Wiskunde...

graph formed from the vertices and edges of a geometric hypercube. hypergraph A hypergraph is a generalization of a graph in which each edge (called a hyperedge...

relationship between chordal bipartite graphs and totally balanced neighborhood hypergraphs of bipartite graphs. A characterization of chordal bipartite...

Természettudományi Értesítő, 34: 104–119. Lovász, László (1972a), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267...

Pythagorean triples with hypotenuse < 1000. 879 = 3 × 293, number of regular hypergraphs spanning 4 vertices, candidate Lychrel seed number 880 = 24 × 5 × 11...

fixed angle Nathan Keller and Noam Lifshitz for The junta method for hypergraphs and the Erdős–Chvátal simplex conjecture Source: American Mathematical...

a balanced labeling – a labeling in which the corresponding hypergraph admits a perfect fractional matching. To illustrate, here are some balanced labeling...

adjacent vertices in more efficient data structures, such as hash tables or balanced binary search trees (the latter representation requires that vertices are...

incidence geometry. In the latter case they are closely related to regular hypergraphs and biregular bipartite graphs, but with some additional restrictions:...

conjecture relating the maximum matching size and minimum transversal size in hypergraphs The second neighborhood problem: does every oriented graph contain a...

Helly family Hypergeometric function identities Hypergeometric series Hypergraph Incidence structure Induction puzzles Integer partition Ferrers graph...

Fundamenta Mathematicae. 23: 135–142. Haim Hanani (1979). "Decomposition of Hypergraphs into Octahedra". Transactions of the New York Academy of Sciences. 319...

exponent √n for strongly regular graphs was done by Spielman (1996). For hypergraphs of bounded rank, a subexponential upper bound matching the case of graphs...

Braß, Peter (2004), "Turán-type extremal problems for convex geometric hypergraphs", in Pach, János (ed.), Towards a theory of geometric graphs, Contemporary...