Results 11 to 20 of about 5,018,820 (150)
Self-complementary hypergraphs [PDF]
Discussiones Mathematicae Graph Theory, 2006 A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, called self-complementing, 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;
A. Pawel Wojda, Wojda, A.
openaire +3 more sources
Vertex-transitive self-complementary uniform hypergraphs [PDF]
European Journal of Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
openaire +4 more sources
Self-complementary hypergraphs
, 2010 In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which are k-complementing. The k-complementing permutations map the edges of a k-uniform hypergraph to the edges of its complement.
Gosselin, Shonda
openaire +4 more sources
A note on k-uniform self-complementary hypergraphs of given order [PDF]
Discussiones Mathematicae Graph Theory, 2009 We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
Artur Szymanski, A. Pawel Wojda
openaire +3 more sources
Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation
, 2021 Social relations are often used to improve recommendation quality when user-item interaction data is sparse in recommender systems. Most existing social recommendation models exploit pairwise relations to mine potential user preferences.
Zhang, Xiangliang +12 more
core +1 more source
Hypergraph Turán Problems in ℓ2-Norm [PDF]
, 2021 There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with the Turán function, the minimum codegree threshold and the uniform Turán ...
Clemen, Felix Christian +2 more
core
A family of \(t\)-regular self-complementary \(k\)-hypergraphs
Transactions on Combinatorics, 2017 Summary: We use the recursive method of construction large sets of \(t\)-designs given by \textit{Q.-r. Wu} [Australas. J. Comb. 4, 229--235 (1991; Zbl 0763.05013)], and present a similar method for constructing \(t\)-subset-regular self-complementary \(k\)-uniform hypergraphs of order \(v\). As an application we show the existence of a new family of 2-
Ariannejad, Masoud +2 more
openaire +2 more sources
Hypergraph Turán Problems in ℓ2-Norm [PDF]
, 2022 There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with the Turán function, the minimum codegree threshold and the uniform Turán ...
Clemen, Felix Christian +2 more
core
A note on 2-subset-regular self-complementary 3-uniform hypergraphs
Ars Comb., 2008 We show that a 2-subset-regular self-complementary 3-uniform hypergraph with $n$ vertices exists if and only if $n\ge 6$ and $n$ is congruent to 2 modulo 4.
Martin Knor, Primoz Potocnik
openaire +3 more sources
Hypergraph models of metabolism [PDF]
, 2014 In this paper, we employ a directed hypergraph model to investigate the extent to which environmental variability influences the set of available biochemical reactions within a living cell.
Crofts, JJ, Chuzhanova, N, Pearcy, N
core