搜索结果: 1-6 共查到“运筹学 Hypergraphs”相关记录6条 . 查询时间(0.042 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Maximum cuts in 3-uniform hypergraphs with sparse neighbourhoods
稀疏邻域 均匀超图 最大切口
2023/4/27
A cut of a hypergraph is a partition of its vertex set into two parts, and the size of the cut is the number of edges which have nonempty intersection with each of the two parts. A classical result of...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Perfect Matchings in hypergraphs
超图 完美匹配 图论
2023/4/27
Matchings are fundamental objects in the study of graph theory. Unlike in graphs, finding maximum matchings in general hypergraphs is NP-hard -- its decision problem is actually one of the Karp’s 21 N...
Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers)
Edge-Colouring Hypergraphs Properly Polychromatically
2010/12/15
Let the chromatic index of a hypergraph be the smallest number of colours needed to colour the
edges such that similarly-coloured edges are disjoint. Likewise, let the cover index be the maximum numb...
The covering number of a hypergraph H is the largest integer k such that the edges of H can be partitioned into k classes such that every vertex is incident with edges from every class. We
prove a nu...
We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph.
Orientability thresholds for random hypergraphs
Orientability thresholds random hypergraphs
2010/12/14
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are all of cardinality h. To w-orient a hyperedge, we assign exactly w of its vertices positive signs with respect to...