Results 21 to 30 of about 7,886 (170)
On Regular Hypergraphs of High Girth [PDF]
The Electronic Journal of Combinatorics, 2014 We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute constant factor (viz., by a factor of between $3/2+o(1)$ and $2 +o(1)$).
ELLIS, DC, Linial, N
openaire +3 more sources
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 +3 more sources
Weak hypergraph regularity and linear hypergraphs
Journal of Combinatorial Theory, Series B, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kohayakawa, Yoshiharu +3 more
openaire +2 more sources
Mapping change in higher-order networks with multilevel and overlapping communities
Applied Network Science, 2023 New network models of complex systems use layers, state nodes, or hyperedges to capture higher-order interactions and dynamics. Simplifying how the higher-order networks change over time or depending on the network model would be easy with alluvial ...
Anton Holmgren +2 more
doaj +1 more source
Counting hypergraph matchings up to uniqueness threshold [PDF]
, 2016 We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\lambda$, each matching $M$ is assigned a weight $\lambda^{|M|}$.
Song, Renjie, Yin, Yitong, Zhao, Jinman
core +2 more sources
Regularity conditions and intersecting hypergraphs [PDF]
Proceedings of the American Mathematical Society, 1981 Let ( F , X ) (\mathcal {F},X) be a hypergraph with a transitive group of automorphisms. Suppose further that any four edges of F \mathcal {F} intersect nontrivially. Denoting | X | \left | X \right | by
openaire +1 more source
Loose Hamilton Cycles in Regular Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 We establish a relation between two uniform models of randomk-graphs (for constantk⩾ 3) onnlabelled vertices: ℍ(k)(n,m), the randomk-graph with exactlymedges, and ℍ(k)(n,d), the randomd-regulark-graph. By extending the switching technique of McKay and Wormald tok-graphs, we show that, for some range ofd = d(n)and a constantc> 0, ifm~cnd, then one ...
Dudek, Andrzej +3 more
openaire +2 more sources
ON REGULARITY OF HYPERGRAPH SEQUENCES
Demonstratio Mathematica, 1994 The paper generalizes two notions connected with the asymptotic behaviour of a hypergraph: the regularity of the hypergraph and the independence of its edges. It is proved that the corresponding asymptotic regularity is equivalent to the average independence of its edges. Some applications to information systems are described.
Pomykała, J. A., Pomykała, J. M.
openaire +2 more sources
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2016 A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N. +2 more
doaj +1 more source
Hypergraphs in m-Polar Fuzzy Environment
Mathematics, 2018 Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set
Muhammad Akram, Gulfam Shahzadi
doaj +1 more source