Results 171 to 180 of about 728,495 (209)
The growth rate of multicolor Ramsey numbers of 3-graphs. [PDF]
Bradač D, Fox J, Sudakov B.
europepmc +1 more source
Enriched knowledge representation in biological fields: a case study of literature-based discovery in Alzheimer's disease. [PDF]
Pu Y, Beck D, Verspoor K.
europepmc +1 more source
Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data- and Cognitive Scientists. [PDF]
Haim E, Stella M.
europepmc +1 more source
Tensor Entropy for Uniform Hypergraphs [PDF]
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.
Indika Rajapakse, Can Chen
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +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 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 +2 more sources
Transversal numbers of uniform hypergraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources

