Results 31 to 40 of about 1,354,678 (274)
Conflict‐free hypergraph matchings [PDF]
Journal of the London Mathematical Society, 2022 A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost‐regular, uniform hypergraph H$\mathcal {H}$ with small maximum codegree has an almost‐perfect matching.
Stefan Glock +4 more
semanticscholar +1 more source
Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles [PDF]
Opuscula Mathematica, 2020 It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order \(v\) if and only if \(v \equiv 0, 1,\text{ or }2\ (\operatorname{mod} 9)\).
Ryan C. Bunge +5 more
doaj +1 more source
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 +2 more
core +2 more sources
A simple and sharper proof of the hypergraph Moore bound [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2022 The hypergraph Moore bound is an elegant statement that characterizes the extremal trade-off between the girth - the number of hyperedges in the smallest cycle or even cover (a subhypergraph with all degrees even) and size - the number of hyperedges in a
Jun-Ting Hsieh +2 more
semanticscholar +1 more source
Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length [PDF]
Opuscula Mathematica, 2020 A complete \(3\)-uniform hypergraph of order \(n\) has vertex set \(V\) with \(|V|=n\) and the set of all \(3\)-subsets of \(V\) as its edge set. A \(t\)-cycle in this hypergraph is \(v_1, e_1, v_2, e_2,\dots, v_t, e_t, v_1\) where \(v_1, v_2,\dots, v_t\)
R. Lakshmi, T. Poovaragavan
doaj +1 more source
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
Inverse Perron Values and Connectivity of a Uniform Hypergraph [PDF]
Electronic Journal of Combinatorics, 2017 In this paper, we show that a uniform hypergraph $\mathcal{G}$ is connected if and only if one of its inverse Perron values is larger than $0$. We give some bounds on the bipartition width, isoperimetric number and eccentricities of $\mathcal{G}$ in ...
Changjiang Bu, Haifeng Li, Jiang Zhou
semanticscholar +1 more source
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
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