3-dimensional matching – a special case of hypergraph matching to 3-uniform hypergraphs. Vertex cover in hypergraphs Bipartite hypergraph Rainbow matching in hypergraphs...
20 KB (2,606 words) - 01:16, 19 February 2025
Maximum-cardinality matching Perfect matching in high-degree hypergraphs Hall-type theorems for hypergraphs The unique perfect matching problem Alan Gibbons...
7 KB (949 words) - 19:27, 6 February 2025
In graph theory, perfect matching in high-degree hypergraphs is a research avenue trying to find sufficient conditions for existence of a perfect matching...
12 KB (1,846 words) - 01:33, 3 January 2024
Generalizing Hall's theorem to hypergraphs requires a generalization of the concepts of bipartiteness, perfect matching, and neighbors. 1. Bipartiteness:...
46 KB (6,498 words) - 00:43, 20 June 2025
S2CID 5226655. Zbl 1028.05035. Lovász, László (1972). "Normal hypergraphs and the perfect graph conjecture". Discrete Mathematics. 2 (3): 253–267. doi:10...
59 KB (7,055 words) - 07:30, 25 February 2025
Line graph (section Line graphs of hypergraphs)
the degrees of the vertices in G, minus m. An independent set in L(G) corresponds to a matching in G. In particular, a maximum independent set in L(G)...
44 KB (5,368 words) - 10:55, 7 June 2025
Graph factorization (section Perfect 1-factorization)
to be k-factorable if it admits a k-factorization. In particular, a 1-factor is a perfect matching, and a 1-factorization of a k-regular graph is a proper...
12 KB (1,320 words) - 07:53, 19 June 2025
Hopcroft–Karp algorithm (category Matching (graph theory))
1016/0020-0190(91)90195-N. Annamalai, Chidambaram (2018), "Finding perfect matchings in bipartite hypergraphs", Combinatorica, 38 (6): 1285–1307, arXiv:1509.07007,...
25 KB (3,746 words) - 14:52, 14 May 2025
Graph isomorphism problem (redirect from Exact graph matching)
regular graphs was done by Spielman (1996). For hypergraphs of bounded rank, a subexponential upper bound matching the case of graphs was obtained by Babai &...
41 KB (4,223 words) - 12:57, 24 June 2025
removal lemma can be used to find large high-girth 3-uniform hypergraphs within arbitrary 3-uniform linear hypergraphs or partial Steiner triple systems. This...
24 KB (3,383 words) - 07:26, 24 March 2025
Blow-up lemma (category Lemmas in graph theory)
find a perfect matching between the buffer vertices and the remaining vertices of G {\displaystyle G} . We borrow all notation introduced in previous...
18 KB (2,789 words) - 22:05, 19 June 2025
graphs Ryser's conjecture relating the maximum matching size and minimum transversal size in hypergraphs The second neighborhood problem: does every oriented...
195 KB (20,069 words) - 07:07, 11 June 2025
Clique problem (category Computational problems in graph theory)
sets in r-uniform hypergraphs", Information Processing Letters, 99 (4): 130–134, doi:10.1016/j.ipl.2006.04.005. Zuckerman, D. (2006), "Linear degree extractors...
84 KB (9,905 words) - 20:49, 29 May 2025
edge-connected. If n {\displaystyle n} is even, G {\displaystyle G} contains a perfect matching.: 32 The maximum cut of G {\displaystyle G} is at most n ( d + λ )...
16 KB (2,768 words) - 01:54, 24 May 2025
(2008), "Exact algorithms for exact satisfiability and number of perfect matchings", Algorithmica, 52 (2): 226–249, doi:10.1007/s00453-007-9149-8, S2CID 37693881...
66 KB (7,684 words) - 15:08, 5 March 2025
Entity–attribute–value model (section Use in databases)
with JSONB in PostgreSQL" (2016) Postgres 9.6, "JSON Types" TinkerPop, Apache. "Apache TinkerPop". tinkerpop.apache.org. "Pattern matching - OpenCog"...
66 KB (9,767 words) - 04:32, 15 June 2025
Percolation threshold (redirect from Thresholds in networks)
bond percolation on the remaining bonds. In discrete mathematics, this problem is known as the 'perfect matching' or the 'dimer covering' problem. System...
239 KB (15,635 words) - 18:07, 9 June 2025
conjecture in random graph theory. Among others, they established the sharp threshold for the existence of a perfect matching in a random hypergraph. Solution...
41 KB (4,346 words) - 12:20, 18 February 2025