Results 51 to 60 of about 538 (183)

Autoregressive Hypergraph

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

Graph Entropy Based on Strong Coloring of Uniform Hypergraphs

Axioms, 2021
The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems ...
Lusheng Fang, Bo Deng, Haixing Zhao, Xiaoyun Lv   +3 more
doaj   +1 more source

Bounded diameter monochromatic component covers

Mathematika, Volume 72, Issue 4, October 2026.
Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley   +1 more source

Existential closure in uniform hypergraphs

Discrete Mathematics
For 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, Robert D. Luther, David A. Pike   +2 more
openaire   +2 more sources

Constrained Colouring and σ-Hypergraphs

Discussiones Mathematicae Graph Theory, 2015
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours.
Caro Yair, Lauri Josef, Zarb Christina
doaj   +1 more source

Multimodal University Academic Performance Prediction Model Based on Heterogeneous Graph Neural Networks

Engineering Reports, Volume 8, Issue 9, September 2026.
The HGN‐MSP model addresses academic performance prediction challenges through multimodal graph learning with semantic alignment and modality balancing, achieving 0.896 AUC and 5.3% improvement over XGBoost in precisely identifying at‐risk students on a dataset of 19,856 students.
Jun Fan, Bin Chen, Byungwon Min, Tao Xie
wiley   +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

On Tight Tree‐Complete Hypergraph Ramsey Numbers

Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.
ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
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

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