Results 1 to 10 of about 1,405,425 (255)

Tight Euler tours in uniform hypergraphs - computational aspects [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski   +2 more
doaj   +5 more sources

Edge Balanced 3-Uniform Hypergraph Designs

Mathematics, 2020
In this paper, we completely determine the spectrum of edge balanced H-designs, where H is a 3-uniform hypergraph with 2 or 3 edges, such that H has strong chromatic number χs(H)=3.
Paola Bonacini, Mario Gionfriddo, Lucia Marino   +2 more
doaj   +3 more sources

Hypergraph expanders of all uniformities from Cayley graphs [PDF]

, 2020
Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, of $3$-uniform hypergraph expanders with polylogarithmic degree.
Conlon, David, Tidor, Jonathan, Zhao, Yufei   +2 more
core   +4 more sources

Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles [PDF]

Opuscula Mathematica, 2019
We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete \(k\)-uniform hypergraph \(K^{(k)}_{n}\) into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For \(n\equiv 2,4,5\pmod 6\)
Meihua, Meiling Guan, Jirimutu
doaj   +2 more sources

Almost Self-Complementary Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2018
A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam Paweł
doaj   +2 more sources

The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]

, 2013
In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
core   +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., Deshpande Charusheela M., Bam Bhagyashree Y.   +2 more
doaj   +3 more sources

The Evolution of Cooperation in Multigames with Uniform Random Hypergraphs

Mathematics, 2023
How to explain the emergence of cooperative behavior remains a significant problem. As players may hold diverse perceptions on a particular dilemma, the concept of multigames has been introduced.
Haozheng Xu, Yiwen Zhang, Xing Jin, Jingrui Wang, Zhen Wang   +4 more
doaj   +2 more sources

Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete [PDF]

Electronic Journal of Combinatorics
Let $(X, \mathcal{F})$ be a hypergraph. The Maker-Breaker game on $(X, \mathcal{F})$ is a combinatorial game between two players, Maker and Breaker. The players take turns claiming vertices from $X$ that have not yet been claimed.
Finn Orson Koepke
openalex   +2 more sources

A note on self-complementary 4-uniform hypergraphs [PDF]

Opuscula Mathematica, 2005
We prove that a permutation \(\theta\) is complementing permutation for a \(4\)-uniform hypergraph if and only if one of the following cases is satisfied: (i) the length of every cycle of \(\theta\) is a multiple of \(8\), (ii) \(\theta\) has \(1\), \(2\)
Artur Szymański
doaj   +1 more source