搜索结果: 1-15 共查到“理学 hypergraphs”相关记录16条 . 查询时间(0.078 秒)
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...
山东大学数学学院研究生舒希超《Non-linear Hamilton cycles in linear quasi-random hypergraphs》论文被国际顶级会议SODA录用（图）
山东大学数学学院 舒希超 理论计算机
2020/10/12
近日，数学学院2019级硕士研究生舒希超收到了来自理论计算机领域顶级会议SODA（ACM-SIAM Symposium of Discrete Algorithms）的论文录用信。舒希超与美国罗德岛大学的韩杰研究员和山大数学学院的王光辉教授合作的论文《Non-linear Hamilton cycles in linear quasi-random hypergraphs》将发表在2021年1月的...
Finite size scaling for the core of large random hypergraphs
Core random hyper-graph random graph low-density parity-check codes XOR-SAT fi nite size scaling
2015/8/21
The (two) core of an hyper-graph is the maximal collection of hyper-edges within which no vertex appears only once. It is of importance in tasks such as efficiently solving a large linear system over ...
Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
Large matchings uniform hypergraphs conjectures of Erdos and Samuels Combinatorics Probability
2011/8/26
Abstract: In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by E...
$k$-Conflict-Free Coloring and $k$-Strong-Conflict-Free Coloring for One Class of Hypergraphs and Online $k$-Conflict-Free Coloring
Hypergraphs Online $k$-Conflict-Free Coloring Combinatorics
2011/8/22
Abstract: Conflict-free coloring is a kind of coloring of hypergraphs requiring each hyperedge to have a color which appears only once. More generally, there are $k$-conflict-free coloring ($k$-CF-col...
Hypergraphs and City Street Networks
Hypergraphs and City Street Networks geometrical objec
2011/8/26
The map of a city's streets constitutes a particular case of spatial complex network. However a city is not limited to its topology: it is above all a geometrical object whose particularity is to orga...
On Multivariate Chromatic Polynomials of Hypergraphs and Hyperedge Elimination
Hypergraphs Colorings Tutte Polynomials
2011/2/21
In this paper, we consider multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The rst set of polynomials is de ned in terms of a deletion-contracti...
On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
hypergraphs associated geometric graphs matroids
2010/11/24
The heterochromatic number hc(H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k colours, there is a hyperedge of H all of whos...
Turánnical hypergraphs
Turánnical hypergraphs math
2010/11/11
This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as ...
Detecting Communities in Tripartite Hypergraphs
Detecting Communities Tripartite Hypergraphs
2010/11/17
In social tagging systems, also known as folksonomies, users collaboratively manage tags to annotate resources. Naturally, social tagging systems can be modeled as a tripartite hypergraph, where there...
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.
Betti numbers of edge ideals of uniform hypergraphs
Betti number hypergraph Hilbert function Stanley-Reisner ring
2010/11/29
We describe the Betti numbers of the edge ideals I(G) of uniform hypergraphs G such that I(G) has linear graded free resolution.