Results 141 to 150 of about 538 (183)

Functional Hypergraphs of Stock Markets. [PDF]

Entropy (Basel)
David JJ, Sabhahit NG, Stramaglia S, Matteo TD, Boccaletti S, Jalan S.   +5 more
europepmc   +1 more source

The growth rate of multicolor Ramsey numbers of 3-graphs. [PDF]

Res Math Sci
Bradač D, Fox J, Sudakov B.
europepmc   +1 more source

Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data- and Cognitive Scientists. [PDF]

Wiley Interdiscip Rev Cogn Sci
Haim E, Stella M.
europepmc   +1 more source

Enriched knowledge representation in biological fields: a case study of literature-based discovery in Alzheimer's disease. [PDF]

J Biomed Semantics
Pu Y, Beck D, Verspoor K.
europepmc   +1 more source

Adaptive dynamic hypergraph learning for ingredient aware food recommendation. [PDF]

Sci Rep
Alkhrijah Y, N Talib A, Singh NSS, Hussein AA.   +3 more
europepmc   +1 more source

Spectral-Structural Decoupled Hypergraph Neural Network for <i>Fritillaria</i> Species Identification Using Hyperspectral Imaging. [PDF]

Foods
Wang X, Fu X, Gao K, Liu W, Xiang W, Zhu Y, Lu Y, Zhang C.   +7 more
europepmc   +1 more source

The tensor as an informational resource. [PDF]

PNAS Nexus
Christandl M.
europepmc   +1 more source

Optimization Method for Robustness of Hypernetwork Communication with Integrated Structural Features. [PDF]

Entropy (Basel)
Chen L, Ma X, Ma F.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Intersection Multigraphs of Uniform Hypergraphs

Graphs and Combinatorics, 1998
A 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
exaly   +3 more sources

The Uniformity Lemma for hypergraphs

Graphs and Combinatorics, 1992
This 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