Kühn, Osthus, and Treglown proved that, for any sufficiently large integer n with n ≡ 0 ( mod 3 ) , if H is a 3-uniform hypergraph with order n and δ 1 ( H ) > n 1 2 2 n / 3 2 then H has a perfect matching, and this bound on δ 1 ( H ) is best possible. In ...
We show that every 3 3 -uniform hypergraph H=(V,E) H=(V,E) with |V(H)|=n |V(H)|=n and minimum pair degree at least (4/5+o(1))n (4/5+o(1))n contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the Pósa-Seymour...
In this paper, we explore evidences that the Lagrangian of a 3-uniform hypergraph is related to the order of its maximum cliques when the number of edges of the hypergraph is in certain range. In particular, we present some results about a conjecture introduced by Y. Peng and C. Zhao (...
Hypergraph degree sequenceDiscrete tomographyReconstruction problemThe study of the degree sequences of h-uniform hypergraphs, say h-sequences, was a longstanding open problem in the case of [equation], until very recently where its decision version was proved to be ......
Hypergraph Matching number Codegree 1. Introduction A hypergraph H is an ordered pair H=(V,E) where V is a finite set (the vertex set) and E is a family of subsets of V (the edge set). An r-uniform hypergraph, or an r-graph for short, is a hypergraph such that all edges have...
odl proved a corresponding counting lemma. Their proofis rather technical, mostly due to the fact that the ‘quasi-random’ hypergraph arisingafter application of Frankl-R¨ odl’s regularity lemma is ‘sparse’ and consequently isdifficult to handle.If the ‘quasi-random’ hypergraph is dense, ...
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphsQuantum Algorithms for Finding Constant-Sized Sub-hypergraphsHypergraphsQuantum algorithmsQuantum walkWe develop a general framework to construct quantum algorithms that detect if a 3-uniform hypergraph given as input contains a sub-hypergraph isomorp...
Based on the definition of a Hamiltonian cycle gived by Janfang Wang and Tony Lee, and the definition of a Hamiltonian chain gived by Katona–Kierstead in a uniform hypergraph, recently, many domestic and foreign researchers studied the hamiltonian cycle decomposition of the uniform hypergraphs Kn...
Given a 3-uniform hypergraph H consisting of a set V of vertices, and T⊆V3 triples, a null labelling is an assignment of ±1 to the triples such that each vertex is contained in an equal number of triples labelled +1 and −1. Thus, the signed degree of each vertex is zero. A...
利用Chernoff界给出完全3部3一致超图和3一致完全超图的Ramsey数r(K(s3,t),n,K3n)≥cn2st+1(logn)-st。 更多例句>> 3) uniformly connected multigraph 一致连通多图形 4) parasimple hypergraph 一致超图 1. In the first section , the definition ofparasimple hypergraphand the sufficient and necessary ...