Results 31 to 40 of about 1,405,425 (255)
On the Sensitivity Complexity of k-Uniform Hypergraph Properties [PDF]
Symposium on Theoretical Aspects of Computer Science, 2016 In this article, we investigate the sensitivity complexity of hypergraph properties. We present a k-uniform hypergraph property with sensitivity complexity O(n(⌈k/3⌉) for any k≥3, where n is the number of vertices.
Qian Li, Xiaoming Sun
semanticscholar +1 more source
Community Detection in General Hypergraph Via Graph Embedding [PDF]
Journal of the American Statistical Association, 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.
Yao Zhen, Junhui Wang
semanticscholar +1 more source
-partite self-complementary and almost self-complementary -uniform hypergraphs
AKCE International Journal of Graphs and Combinatorics, 2020 A hypergraph is said to be -partite -uniform if its vertex set can be partitioned into non-empty sets so that every edge in the edge set , consists of precisely one vertex from each set , . It is denoted as or if for .
L.N. Kamble +2 more
doaj +1 more source
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2023 Let H = (V, E) be a hypergraph, where V is a set of vertices and E is a set of non-empty subsets of V called edges. If all edges of H have the same cardinality r, then H is an r-uniform hypergraph; if E consists of all r-subsets of V, then H is a ...
Tian Yingzhi +3 more
doaj +1 more source
On the zeroes of hypergraph independence polynomials [PDF]
Combinatorics, probability & computing, 2022 We study the locations of complex zeroes of independence polynomials of bounded-degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical physics, algorithms, and combinatorics.
David J. Galvin +4 more
semanticscholar +1 more source
Cycle Decompositions in 3-Uniform Hypergraphs
Combinatorica, 2023 We show that $3$-graphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing that our bounds are best possible up to the $o(1)$ term.
Piga, Simón +1 more
openaire +2 more sources
A Perfect Sampler for Hypergraph Independent Sets [PDF]
International Colloquium on Automata, Languages and Programming, 2022 The problem of uniformly sampling hypergraph independent sets is revisited. We design an efficient perfect sampler for the problem under a condition similar to that of the asymmetric Lov\'asz Local Lemma.
Guoliang Qiu, Yanheng Wang, Chihao Zhang
semanticscholar +1 more source
Covering Non-uniform Hypergraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boros, Endre +3 more
openaire +2 more sources
Learning over Families of Sets - Hypergraph Representation Learning for Higher Order Tasks [PDF]
SDM, 2021 Graph representation learning has made major strides over the past decade. However, in many relational domains, the input data are not suited for simple graph representations as the relationships between entities go beyond pairwise interactions.
Balasubramaniam Srinivasan +2 more
semanticscholar +1 more source
Saturated r-uniform hypergraphs
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdős, Paul +2 more
openaire +1 more source