Results 61 to 70 of about 25,758 (195)
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
, 2008 Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs,
Cooley, Oliver +3 more
core +2 more sources
Journal of Time Series Analysis, EarlyView.ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source
Hyper-Null Models and Their Applications
Entropy, 2023 Null models are crucial tools for investigating network topological structures. However, research on null models for higher-order networks is still relatively scarce.
Yujie Zeng +3 more
doaj +1 more source
Two‐Round Ramsey Games on Random Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source
International Mathematics Research NoticesAbstract We showthat for every integer $k\geqslant 3$ the set of Turán densities of $k$-uniform hypergraphs has an accumulation point in $[0,1)$. In particular, $1/2$ is an accumulation point for the set of Turán densities of $3$-uniform hypergraphs.
Conlon, David, Schülke, Bjarne
openaire +2 more sources
Contributions to Discrete Mathematics, 2023 This article presents an extension of the study of metric and partition dimension to hypergraphs. We give sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.
Javaid, Imran +3 more
openaire +3 more sources
A Vulnerability Lens for Intuitive‐Logic Scenarios
FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
wiley +1 more source
Single‐Cell and Spatial Omics: Methods and Applications
MedComm, Volume 7, Issue 4, April 2026.Systematically summarized the breakthrough sequencing technologies and computational methods for single‐cell and spatial omics across multiple omics layers, including genome, epigenome, transcriptome, proteome, and metabolome. State‐of‐the‐art methods for multi‐omics integration, cross‐modal integration, and cross‐scale integration were reviewed, with ...
Xiaoping Cen +10 more
wiley +1 more source
Journal of Physics: Complexity, 2023 Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size.
Tanu Raghav +2 more
doaj +1 more source
The cyclic coloring complex of a complete k-uniform hypergraph
, 2011 In this paper, we study the homology of the cyclic coloring complex of three different types of $k$-uniform hypergraphs. For the case of a complete $k$-uniform hypergraph, we show that the dimension of the $(n-k-1)^{st}$ homology group is given by a ...
Rundell, Sarah Crown
core +2 more sources