Results 81 to 90 of about 730,755 (216)
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles [PDF]
, 2009 Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1, .–.–., vn and edges v1v2v3, v2v3v4, .–.–., vn−1vnv1, vnv1v2. We prove that the smallest integer N = N(n) for which every red–blue colouring of the edges of the complete
Haxell, Penny +5 more
core +1 more source
Transversals and domination in uniform hypergraphs
European Journal of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Csilla Bujtás +2 more
openaire +3 more sources
Global Graph Surrogates and Neural Graph Elements for Computational Mechanics
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Machine learning surrogates are increasingly used to accelerate physics‐based simulations by predicting full‐field responses at a fraction of the computational cost. In this contribution, we present two complementary graph‐based approaches for surrogate modelling in computational mechanics.
Rutwik Gulakala, Marcus Stoffel
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 +4 more sources
Robustness of the Sauer–Spencer Theorem
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen +3 more
wiley +1 more source
On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz +2 more
wiley +1 more source
Random hypergraph irregularity
, 2016 A hypergraph is k-irregular if there is no set of k vertices all of which have the same degree.
Bollobás, Béla +3 more
core +1 more source
ON THE SPECTRA OF TENSOR JOIN OF HYPERGRAPHS [PDF]
Journal of Algebraic SystemsIn this paper, we consider certain classes of hypergraphs constructed from the tensor join of hypergraphs, specifically the tensor join of hypergraphs constrained by vertex subsets and the $(H, \mathcal{T}_{\mathcal{S}})$-join of hypergraphs constrained ...
Vishnupriya Ramkumar, Rajkumar Rajendran
doaj +1 more source
Molecular Ecology, Volume 35, Issue 19, October 2026.ABSTRACT Rates of evolutionary change vary by gene. While some broad gene categories are highly conserved with little divergence over time, others undergo continuous selection pressure and are highly divergent among populations or species. But such comparative evolutionary studies rely on gene ontology categories that are rarely validated in the study ...
Maria L. Rodgers +11 more
wiley +1 more source