超图中的C-圈

在本文我们给出了一个新的定义C-圈.设f(n,k,r)是不含C-圈的n阶r-一致超图的最大可能边数,我们主要是确定f(n,k,r)或给出它的一个下界.另外,我们给出了超图不含C-圈的一个充分必要条件.     

无圈超图的计数

研究了标号超图的计数, 得到2个公式: 一个是关于严格(D)-连通无圈齐超图的显式计数公式, 另一个是关于线性无圈超图数目的递推公式.     

超图的路和圈

超图是离散数学中最一般最复杂的结构 .无圈超图已被证明在数据库设计中非常有用 .从关系数据的结构出发 ,建立了关于超图的路、连通性和圈的新的公理系统 .该系统与特殊情形———图是符合的 .引入了虚圈和实圈的概念 ,这是一对相关联的概念 .虚圈在特殊情形———图中不存在 ,退化掉了 .定义了超图圈的相关性和独立性 ,给出了超图中最大独立实圈数目的计数公式 ,对特殊情形———图 ,这个公式就是Euler公式 .     

严格(d)-连通无圈超图的计数

研究了一般的标号严格(d)-连通无圈超图的计数,得到了n阶标号严格(d)-连通无圈超图的计数公式.     

匀称无圈超图的计数

研究了标号匀称无圈超图的计数, 得到了一般的$n$阶标号r-匀称(d)-森林和n阶标号r-匀称(d)-真森林的递推公式,并分别得到了包含和不包含独立点的$n$阶标号森林的计数显式.     

无圈超图规模的进一步研究

本文在王建方给出的严格(d)-连通κ-匀齐无圈超图的规模的基础上,进一步研究n阶(d)-连通κ-匀齐无圈超图的规模和非严格(d)-连通κ-匀齐无圈超图的规模,并分别得到它们规模的上下界.     

超图中的着色问题

本文是近三十年来有关超图中涉及的着色问题的综述。它包含了有关超图着色中的基本结果,临界可着色性,２－可着色性,非２－可着色性以及在超图中与顶点着色、边着色和其它着色相关的极值问题。     

树环中的流量疏导问题研究

H为定义在树环G上的一个超图,将H的每条超边映射为G中不同的映射树,称为超边在G中的嵌入问题.超图在树环中的嵌入问题即为寻找H在G中的最优映射使得G中任一边被H所有超边的映射经过的最大次数最小.应用超图嵌入圈(MCHEC)问题的算法可得超图嵌入树环问题的一个2-近似算法.     

关于不含k-C-圈的n阶r-一致超图的若干结果

主要讨论了不含k-C-圈的n阶r-一致超图,对不同的k,分别得出了它的极大边数的一个下界,并且得出在有些情况下它的下界是最大的.另外,我们得到了Krn含k-C-圈的一个充分必要条件.     

完全3-一致超图的圈分解

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.     

超图拉格朗日函数

超图拉格朗日函数是极值组合中的一个有效工具,本文回顾其在几个重要问题中的应用并提出与超图拉格朗日函数相关的公开问题.     

Hypergraph limits: A regularity approach

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     

最大k—一致超图

本文刻划直径为ｄ 的最大边数的ｋ－一致超图的结构,推广了Ｏｒｅ 的一个结果     

A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge

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

1. one of G and H contains a spanning graph‐star, and each vertex of the other is contained in a graph edge, or
2. 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.

     

On Axioms Contituting the Foundation of Hypergraph Theory

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.     

基于超图的超网络研究综述

超网络是一般网络的一类自然推广。超网络的研究将会有助于理解“复杂系统之所以复杂”这一极其重要的问题。现实世界中,很多复杂的系统都可以用超网络描述。超网络分为基于网络的超网络与基于超图的超网络。本文主要介绍的是基于超图的超网络,首先对超图理论进行描述,然后对基于超图的超网络进行分析,接着提出了基于超图的超网络和多层超网络的转换及实例并提出了基于超图的超网络演化模型。本文最后对超网络今后的研究方向进行了探讨,其中,超网络的指标构建、动力学研究、链路预测、应用等方面还有待于深入研究。     

Ideal-Based k-Zero-Divisor Hypergraph of Commutative Rings

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.     

Embedding hypertrees into steiner triple systems

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.