Results 181 to 190 of about 1,981 (215)
On the capacity of uniform hypergraphs [PDF]
IEEE Transactions on Information Theory, 1990 The capacity of uniform hypergraphs can be defined as a natural generalization of the Shannon capacity of graphs. Corresponding to every uniform hypergraph there is a discrete memoryless channel in which the zero error capacity, in the case of the smallest list size for which it is positive, equals the capacity of the hypergraph, and vice versa.
K Marton, J Körner
exaly +4 more sources
Tensor Entropy for Uniform Hypergraphs [PDF]
IEEE Transactions on Network Science and Engineering, 2020 In this paper, we develop the notion of entropy for uniform hypergraphs via tensor theory. We employ the probability distribution of the generalized singular values, calculated from the higher-order singular value decomposition of the Laplacian tensors, to fit into the Shannon entropy formula.
, Can Chen
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Intersection Multigraphs of Uniform Hypergraphs
Graphs and Combinatorics, 1998A hypergraph \(H=(V,\{X_i \mid i\in I\})\) is \(k\)-uniform if all hyperedges \(X_i\) have the same cardinality \(k\); it is \(k\)-conformal if there is some graph \(G\) such that \(H\) is isomorphic to the hypergraph of all cliques with \(k\) vertices of \(G\).
Erich Prisner, Prisner Erich
exaly +3 more sources
2020
Summary: Non-uniform hypergraphs are a generalization of hypergraphs in which not all edges need to have the same cardinality. It allows them to support a more complex data structure. In this paper, we extend some results for non-uniform hypergraphs and generalize the spectral results for uniform hypergraphs to non-uniform hypergraphs.
SHIRDEL, G.H. +2 more
openaire +2 more sources
Summary: Non-uniform hypergraphs are a generalization of hypergraphs in which not all edges need to have the same cardinality. It allows them to support a more complex data structure. In this paper, we extend some results for non-uniform hypergraphs and generalize the spectral results for uniform hypergraphs to non-uniform hypergraphs.
SHIRDEL, G.H. +2 more
openaire +2 more sources
The Uniformity Lemma for hypergraphs
Graphs and Combinatorics, 1992This is an extension of Szemerédi's theorem called the Uniformity Lemma for Graphs (see \textit{E. Szemerédi} [Problèmes combinatoires et théorie des graphes, Orsay 1976, Colloq. int. CNRS No. 260, 399-401 (1978; Zbl 0413.05055)]) to \(r\)-uniform hypergraphs. Two applications of the result are announced: proof of a conjecture of Erdős concerning Turán-
Peter Frankl, Vojtech Rödl
openaire +2 more sources
The Laplacian of a uniform hypergraph
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng-Long Hu, Liqun Qi 0001
openaire +1 more source
Transversal numbers of uniform hypergraphs
Graphs and Combinatorics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon, Alon Noga
exaly +3 more sources
On the Turán Density of Uniform Hypergraphs
Acta Mathematicae Applicatae Sinica, English Series, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, An, Gao, Guo-rong
openaire +2 more sources
Domination game on uniform hypergraphs [PDF]
Discrete Applied Mathematics, 2019 In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $\mathcal{H}$ by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the set of vertices dominated so far. The game is over if all vertices of $\mathcal{H}$ are dominated.
Csilla Bujtas +2 more
exaly +5 more sources