Results 41 to 50 of about 1,405,425 (255)
Exact Recovery in the General Hypergraph Stochastic Block Model [PDF]
IEEE Transactions on Information Theory, 2021 This paper investigates fundamental limits of exact recovery in the general $d$ -uniform hypergraph stochastic block model ( $d$ -HSBM), wherein $n$ nodes are partitioned into $k$ disjoint communities with relative sizes $(p_{1},\ldots , p_{k ...
Q. Zhang, V. Tan
semanticscholar +1 more source
Spectra of uniform hypergraphs
Linear Algebra and its Applications, 2012 We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a. multidimensional arrays.
Cooper, Joshua, Dutle, Aaron
openaire +3 more sources
Turán Problems on Non-Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2014 A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set of edge types.
Johnston, J. Travis, Lu, Linyuan
openaire +3 more sources
Covering complete partite hypergraphs by monochromatic components [PDF]
, 2016 A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\'arf\'as: if the edges of a complete graph K are colored with ...
Gyárfás, András, Király, Zoltán
core +2 more sources
Hypergraph Ramsey numbers of cliques versus stars [PDF]
Random Struct. Algorithms, 2022 Let Km(3)$$ {K}_m^{(3)} $$ denote the complete 3‐uniform hypergraph on m$$ m $$ vertices and Sn(3)$$ {S}_n^{(3)} $$ the 3‐uniform hypergraph on n+1$$ n+1 $$ vertices consisting of all n2$$ \left(\genfrac{}{}{0ex}{}{n}{2}\right) $$ edges incident to a ...
D. Conlon +5 more
semanticscholar +1 more source
The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension
Discussiones Mathematicae Graph Theory, 2021 Given a positive integer n and an r-uniform hypergraph F, the Turán number ex(n, F ) is the maximum number of edges in an F -free r-uniform hypergraph on n vertices.
Chen Pingge, Liang Jinhua, Peng Yuejian
doaj +1 more source
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Discussiones Mathematicae Graph Theory, 2022 A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj +1 more source
Nearly Perfect Matchings in Uniform Hypergraphs
SIAM Journal on Discrete Mathematics, 2021 In this paper, we study degree conditions for the existence of large matchings in uniform hypergraphs. We prove that for integers $k,l,n$ with $k\ge 3$, $k/2{n-l\choose k-l}-{(n-l)-(\lceil n/k \rceil-2)\choose 2}$, then $H$ has a matching covering all but a constant number of vertices.
Lu, Hongliang +2 more
openaire +2 more sources
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source
On the fractional total domatic numbers of incidence graphs
Mathematical Modelling and Control, 2023 For a hypergraph $ H $ with vertex set $ X $ and edge set $ Y $, the incidence graph of hypergraph $ H $ is a bipartite graph $ I(H) = (X, Y, E) $, where $ xy\in E $ if and only if $ x\in X $, $ y\in Y $ and $ x\in y $.
Yameng Zhang, Xia Zhang
doaj +1 more source