Results 31 to 40 of about 622 (164)
3-uniform hypergraphs and linear cycles [PDF]
Electronic Notes in Discrete Mathematics, 2017 Improved the writing, more explanation added and corrections ...
Ergemlidze, Beka +2 more
openaire +3 more sources
Isomorphism for random k-uniform hypergraphs
Information Processing Letters, 2021 We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random $r$-regular, $k$-uniform hypergraphs $H_{n,r;k},r=O(1)$.
Debsoumya Chakraborti +3 more
openaire +2 more sources
On $\alpha$-spectral theory of a directed k-uniform hypergraph [PDF]
Computer Science Journal of Moldova, 2020 In this paper, we study a k-uniform directed hypergraph in general form and introduce its adjacency tensor, Laplacian tensor and signless Laplacian tensor. For the $k$-uniform directed hypergraph $\mathcal{H}$ and $0\leq \alpha
Gholam-Hasan Shirdel +2 more
doaj
Matchings and Hamilton cycles in hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj +1 more source
Hypergraph partitioning using tensor eigenvalue decomposition.
PLoS ONE, 2023 Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +1 more source
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
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.
Füredi, Zoltán +2 more
openaire +3 more sources
On the α-Spectral Radius of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2020 For 0 ≤ α ---lt--- 1 and a uniform hypergraph G, the α-spectral radius of G is the largest H-eigenvalue of αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal tensor of degrees and the adjacency tensor of G, respectively. We give upper bounds for the α-
Guo Haiyan, Zhou Bo
doaj +1 more source
Coloring $$d$$ d -Embeddable $$k$$ k -Uniform Hypergraphs [PDF]
Discrete & Computational Geometry, 2013 18 ...
Carl Georg Heise +3 more
openaire +4 more sources
Sierpiński products of r-uniform hypergraphs
The Art of Discrete and Applied Mathematics, 2022 Summary: If \(H_1\) and \(H_2\) are \(r \)-uniform hypergraphs and \(f\) is a function from the set of all \((r - 1)\)-element subsets of \(V(H_1)\) into \(V(H_2)\), then the Sierpiński product \(H_1 \otimes_f H_2\) is defined to have vertex set \(V(H_1) \times V(H_2)\) and hyperedges falling into two classes: \[ (g, h_1) (g, h_2) \cdots (g, h_r ...
Budden, Mark, Hiller, Josh
openaire +2 more sources