Results 71 to 80 of about 730,755 (216)
Hypergraph models of metabolism [PDF]
, 2014 In this paper, we employ a directed hypergraph model to investigate the extent to which environmental variability influences the set of available biochemical reactions within a living cell.
Crofts, JJ, Chuzhanova, N, Pearcy, N
core
Kneser Colorings of Uniform Hypergraphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 Abstract For fixed positive integers r, k and l with l r , and an r-uniform hypergraph H, let κ ( H , k , l ) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least l vertices. Consider the function KC ( n , r , k , l ) = max H ∈
Carlos Hoppen +2 more
openaire +2 more sources
Heliyon, 2022 Topological invariants are numerical parameters of graphs or hypergraphs that indicate its topology and are known as graph or hypergraph invariants. In this paper, topological indices of hypergraphs such as Wiener index, degree distance index and Gutman ...
Sakina Ashraf +3 more
doaj +1 more source
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
Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, Volume 113, Issue 4, Page 634-649, December 2026.ABSTRACT Let n , k be positive integers such that n ≥ k and G be a tripartite graph with parts A , B , C such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n. Denote the edge densities of G [ A , B ] , G [ A , C ] and G [ B , C ] by α , β and γ, respectively. In this paper, we study edge density conditions for the existence of k vertex‐disjoint triangles in a ...
Mingyang Guo, Klas Markström
wiley +1 more source
Existential closure in uniform hypergraphs
Discrete MathematicsFor a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of $T$ and no vertex of $S\setminus T$.
Andrea C. Burgess +2 more
openaire +2 more sources
Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
Journal of Graph Algorithms and Applications, 2013 Let R(Ka,b,Kc,d) be the minimum number n so that any n-vertex simple undirected graph G contains a Ka,b or its complement G′ contains a Kc,d. We demonstrate constructions showing that R(K2,b,K2,d) > b+d+1 for d ≥ b ≥ 2.
Tapas Kumar Mishra +1 more
doaj +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
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, Volume 113, Issue 4, Page 663-676, December 2026.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source