Results 61 to 70 of about 11,526 (190)
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
Recognizing the P_4-structure of claw-free graphs and a larger graph class [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 The P_4-structure of a graph G is a hypergraph \textbfH on the same vertex set such that four vertices form a hyperedge in \textbfH whenever they induce a P_4 in G.
Luitpold Babel +2 more
doaj +1 more source
The Evolution of Cooperation in Multigames with Uniform Random Hypergraphs
Mathematics, 2023 How to explain the emergence of cooperative behavior remains a significant problem. As players may hold diverse perceptions on a particular dilemma, the concept of multigames has been introduced.
Haozheng Xu +4 more
doaj +1 more source
The Turán problem for hypergraphs of fixed size [PDF]
, 2005 We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that it contains. If F is an r-uniform hypergraph with f edges we show that [pi](F) =3 and f->[infinity]
Keevash, Peter
core
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
, 2013 We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the 'short code' of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur and Guruswami [FOCS 2013] to incorporate this code for ...
Guruswami, Venkatesan +4 more
core +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
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
CAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 396-410, April 2026.ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Colorful Subhypergraphs in Uniform Hypergraphs
The Electronic Journal of Combinatorics, 2017 There are several topological results ensuring in any properly colored graph the existence of a colorful complete bipartite subgraph, whose order is bounded from below by some topological invariants of some topological spaces associated to the graph. Meunier [Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 2014 ...
openaire +3 more sources
2-Colorability of r-Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2019 A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge is completely colored by a single color. We present a complete algebraic characterization of the 2-colorability of r-uniform hypergraphs. This generalizes a well known algebraic characterization of k-colorability of graphs due to Alon, Tarsi, Lovasz, de ...
Krul, Michael, Thoma, Luboš
openaire +3 more sources
Hypergraphs with arbitrarily small codegree Turán density
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley +1 more source