Results 51 to 60 of about 730,755 (216)
International Journal of Mathematics and Mathematical Sciences, 2005 In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj +1 more source
On the Sensitivity Complexity of k-Uniform Hypergraph Properties [PDF]
, 2017 In this paper we investigate the sensitivity complexity of hypergraph properties. We present a k-uniform hypergraph property with sensitivity complexity O(n^{ceil(k/3)}) for any k >= 3, where n is the number of vertices. Moreover, we can do better when k
Li, Qian, Sun, Xiaoming
core +1 more source
Maximum packings of the a-fold complete 3-uniform hypergraph with loose 3-cycles [PDF]
, 2020 It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order v if and only if v ≡0, 1, or 2 (mod 9). For all positive integers λand v, we find a maximum packing with loose 3-cycles of the λ-fold ...
Liebrecht, Rachel +5 more
core +1 more source
Saturated r-uniform hypergraphs
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, Zoltán Füredi, Zsolt Tuza
openaire +2 more sources
Community Detection in General Hypergraph Via Graph Embedding
, 2021 Conventional network data have largely focused on pairwise interactions between two entities, yet multi-way interactions among multiple entities have been frequently observed in real-life hypergraph networks.
Yaoming Zhen (11662787) +1 more
core +1 more source
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
Dense, irregular, yet always graphic $3$-uniform hypergraph degree sequences [PDF]
, 2023 A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it.
Li, Runze, Miklos, Istvan
core
Covering Non-uniform Hypergraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros +3 more
openaire +2 more sources
Examples of 3-uniform hypergraphs.
, 2023 (A) Complete 3-uniform hypergraph with N = 4 nodes. (B) Cyclic 3-uniform hypergraph with N = 8 nodes. (C) Star 3-uniform hypergraph with N = 5 nodes. Each colored oval represents a hyperedge.
Naoki Masuda (82398) +1 more
core +1 more source
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