Results 71 to 80 of about 1,354,678 (274)
$3$-uniform hypergraphs and linear cycles [PDF]
Electronic Notes in Discrete Mathematics, 2016 Improved the writing, more explanation added and corrections ...
Beka Ergemlidze +2 more
openalex +7 more sources
Rainbow connection numbers of some classes of s-overlapping r-uniform hypertrees with size t
AIMS MathematicsThe rainbow connection concept was developed to determine the minimum number of passwords required to exchange encrypted information between two agents. If the information exchange involves divisions managing more than two agents, the rainbow connection ...
Sitta Alief Farihati +2 more
doaj +1 more source
On the Rectilinear Crossing Number of Complete Uniform Hypergraphs
, 2016 In this paper, we consider a generalized version of the rectilinear crossing number problem of drawing complete graphs on a plane. The minimum number of crossing pairs of hyperedges in the $d$-dimensional rectilinear drawing of a $d$-uniform hypergraph ...
Anshu, Anurag +3 more
core +1 more source
Quantum walks on regular uniform hypergraphs [PDF]
Scientific Reports, 2018 AbstractQuantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information stored inherently. Therefore, we can explore the potential of quantum walks on hypergraphs.
Ying Liu +3 more
openaire +4 more sources
Berge Cycles in Non-Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2020 We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.
Ruth Luo +2 more
openaire +3 more sources
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +1 more source
On the spectrum of hypergraphs
, 2016 Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different structural properties
Chris Ritchie (1952305) +4 more
core +3 more sources
More Results on The Smallest One-Realization of A Given Set II
Discussiones Mathematicae Graph Theory, 2019 Let S be a finite set of positive integers. A mixed hypergraph ℋ is a onerealization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1.
Diao Kefeng, Lu Fuliang, Zhao Ping
doaj +1 more source
Covering Non-uniform Hypergraphs
Journal of Combinatorial Theory, Series B, 2001 AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) denote the cardinality of a minimum cover in the hypergraph H, and let us denote by g(n) the maximum of τ(H) taken over all hypergraphs H with n vertices and with no two hyperedges of the same size. We show thatg(n)
Endre Boros +3 more
openaire +1 more source
Fractional and integer matchings in uniform hypergraphs [PDF]
European Journal of Combinatorics, 2013 Accepted for publication by the European Journal of ...
Daniela Kühn +2 more
openaire +4 more sources