Results 81 to 90 of about 728,495 (209)

Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs [PDF]

, 2023
The Pareto H-eigenvalues of nonnegative tensors and (adjacency tensors of) uniform hypergraphs are studied. Particularly, it is shown that the Pareto H-eigenvalues of a nonnegative tensor are just the spectral radii of its weakly irreducible principal ...
Zhou, Bo, Zheng, Lu
core   +1 more source

Tight Euler tours in uniform hypergraphs - computational aspects [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski   +2 more
doaj   +1 more source

Anti-Ramsey Hypergraph Numbers

Electronic Journal of Graph Theory and Applications, 2021
The anti-Ramsey number arn(H) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H.
Mark Budden, William Stiles
doaj   +1 more source

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, Julia Böttcher, Yoshiharu Kohayakawa, Mihir Neve   +3 more
wiley   +1 more source

On rainbow-free colourings of uniform hypergraphs [PDF]

, 2021
We study rainbow-free colourings of k-uniform hypergraphs; that is, colourings that use k colours but with the property that no hyperedge attains all colours.
Ragnar Groot Koerkamp, Stanislav Živný
core   +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, Lyuben Lichev, Alexandra Wesolek   +2 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   +4 more sources

Rates of Evolution Differ Between Cell Types Identified by Single‐Cell RNAseq in Threespine Stickleback

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, Swapna Subramanian, Lauren E. Fuess, Wan He, Samuel V. Scarpino, Andrea J. Roth‐Monzón, Daniel L. Jeffries, Martine Seignon, Kathryn Milligan‐McClellan, Rebecca Carrier, Natalie C. Steinel, Daniel I. Bolnick   +11 more
wiley   +1 more source

Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract It is well‐known that polynomial versions of theorems of Rödl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erdős–Hajnal conjecture. In this note, we prove that these three conjectures are in fact equivalent, extending several previous particular results in this direction by Fox, Nguyen ...
Matija Bucić, Jacob Fox, Huy Tuan Pham
wiley   +1 more source

Construction of S⁽³⁾ (2, 3)-Designs of Any Index

Mathematics
Let H(3) be a uniform hypergraph of rank 3. A hyperstar S(3)(2,3) of centre C={x,y} is a 3-uniform hypergraph with three hyperedges, all having the centre C={x,y} in common, with x and y of degree 3 and the remaining vertices of degree 1.
Antonio Causa, Mario Gionfriddo, Elena Guardo   +2 more
doaj   +1 more source