共查询到20条相似文献,搜索用时 171 毫秒
1.
2.
3.
4.
研究了一般的标号严格(d)-连通无圈超图的计数,得到了n阶标号严格(d)-连通无圈超图的计数公式. 相似文献
5.
6.
7.
8.
H为定义在树环G上的一个超图,将H的每条超边映射为G中不同的映射树,称为超边在G中的嵌入问题.超图在树环中的嵌入问题即为寻找H在G中的最优映射使得G中任一边被H所有超边的映射经过的最大次数最小.应用超图嵌入圈(MCHEC)问题的算法可得超图嵌入树环问题的一个2-近似算法. 相似文献
9.
主要讨论了不含k-C-圈的n阶r-一致超图,对不同的k,分别得出了它的极大边数的一个下界,并且得出在有些情况下它的下界是最大的.另外,我们得到了Krn含k-C-圈的一个充分必要条件. 相似文献
10.
The problem of decomposing a complete 3-uniform hypergraph into Hamilton cycles was introduced by Bailey and Stevens using a generalization of Hamiltonian chain to uniform hypergraphs by Katona and Kierstead. Decomposing the complete 3-uniform hypergraphs K_n~(3) into k-cycles(3 ≤ k n) was then considered by Meszka and Rosa. This study investigates this problem using a difference pattern of combinatorics and shows that K_(n·5m)~(3) can be decomposed into 5-cycles for n ∈{5, 7, 10, 11, 16, 17, 20, 22, 26} using computer programming. 相似文献
11.
12.
Yufei Zhao 《Random Structures and Algorithms》2015,47(2):205-226
A sequence of k‐uniform hypergraphs is convergent if the sequence of homomorphism densities converges for every k‐uniform hypergraph F. For graphs, Lovász and Szegedy showed that every convergent sequence has a limit in the form of a symmetric measurable function . For hypergraphs, analogous limits were constructed by Elek and Szegedy using ultraproducts. These limits had also been studied earlier by Hoover, Aldous, and Kallenberg in the setting of exchangeable random arrays. In this paper, we give a new proof and construction of hypergraph limits. Our approach is inspired by the original approach of Lovász and Szegedy, with the key ingredient being a weak Frieze‐Kannan type regularity lemma. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 205–226, 2015 相似文献
13.
14.
15.
Two n‐vertex hypergraphs G and H pack, if there is a bijection such that for every edge , the set is not an edge in H. Extending a theorem by Bollobás and Eldridge on graph packing to hypergraphs, we show that if and n‐vertex hypergraphs G and H with with no edges of size 0, 1, and n do not pack, then either
- one of G and H contains a spanning graph‐star, and each vertex of the other is contained in a graph edge, or
- one of G and H has edges of size not containing a given vertex, and for every vertex x of the other hypergraph some edge of size does not contain x.
16.
17.
Jian-fang Wang 《应用数学学报(英文版)》2005,21(3):495-498
Hypergraphs are systems of finite sets, being the most general structures in discrete mathematics and powerful tools in dealing with discrete systems. In general, a branch of mathematics is built on some axioms. Informational scientists introduced the acyclic axiom for hypergraphs. In this paper, we first list several results concerning acyclic hypergraphs, in order to show that Acyclic-Axioms constitute the foundation of acyclic hypergraph theory. Then we give the basic theorem which shows that the Cycle-Axiom covers the Acyclic-Axioms and constitutes the foundation of hypergraph theory. 相似文献
18.
超网络是一般网络的一类自然推广。超网络的研究将会有助于理解“复杂系统之所以复杂”这一极其重要的问题。现实世界中,很多复杂的系统都可以用超网络描述。超网络分为基于网络的超网络与基于超图的超网络。本文主要介绍的是基于超图的超网络,首先对超图理论进行描述,然后对基于超图的超网络进行分析,接着提出了基于超图的超网络和多层超网络的转换及实例并提出了基于超图的超网络演化模型。本文最后对超网络今后的研究方向进行了探讨,其中,超网络的指标构建、动力学研究、链路预测、应用等方面还有待于深入研究。 相似文献
19.
Let R be a commutative ring,I an ideal of R and k ≥ 2 a fixed integer.The ideal-based k-zero-divisor hypergraph HkI(R) of R has vertex set ZI(R,k),the set of all ideal-based k-zero-divisors of R,and for distinct elements x1,x2,…,xk in ZI(R,k),the set {x1,x2,…,xk} is an edge in HkI(R) if and only if x1x2…xk ∈ I and the product of the elements of any (k-1)-subset of {x1,x2,…,xk} is not in I.In this paper,we show that H3I(R) is connected with diameter at most 4 provided that x2 (∈) I for all ideal-based 3-zero-divisor hypergraphs.Moreover,we find the chromatic number of H3 (R) when R is a product of finite fields.Finally,we find some necessary conditions for a finite ring R and a nonzero ideal I of R to have H3I (R) planar. 相似文献
20.
In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. 相似文献