Results 11 to 20 of about 997 (114)
Hypergraph Based Berge Hypergraphs [PDF]
Fix a hypergraph $\mathcal{F}$. A hypergraph $\mathcal{H}$ is called a {\it Berge copy of $\mathcal{F}$} or {\it Berge-$\mathcal{F}$} if we can choose a subset of each hyperedge of $\mathcal{H}$ to obtain a copy of $\mathcal{F}$. A hypergraph $\mathcal{H}$ is {\it Berge-$\mathcal{F}$-free} if it does not contain a subhypergraph which is Berge copy of $\
Balko, Martin +4 more
openaire +3 more sources
Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and ...
Corinna Coupette +2 more
openaire +3 more sources
The following very natural problem was raised by Chung and Erd s in the early 80's and has since been repeated a number of times. What is the minimum of the Tur n number $\text{ex}(n,\mathcal{H})$ among all $r$-graphs $\mathcal{H}$ with a fixed number of edges?
Matija Bucić +3 more
openaire +4 more sources
Signaling pathways function as the information-passing mechanisms of cells. A number of databases with extensive manual curation represent the current knowledge base for signaling pathways. These databases motivate the development of computational approaches for prediction and analysis.
Anna, Ritz +4 more
openaire +2 more sources
Multi-order hypergraph convolutional networks integrated with self-supervised learning
Hypergraphs, as a powerful representation of information, effectively and naturally depict complex and non-pair-wise relationships in the real world. Hypergraph representation learning is useful for exploring complex relationships implicit in hypergraphs.
Jiahao Huang +5 more
doaj +1 more source
Nonintersecting Ryser Hypergraphs [PDF]
8 pages, some corrections in the proof of Lemma 3.6, added more explanation in the appendix, and other minor ...
Bishnoi A., Pepe V.
openaire +2 more sources
The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph $H$ is a hypergraph where each edge is assigned a type $\Pi_i$ that determines which of possible colorings of the edge are proper. A vertex coloring of $H$ is proper if it is proper for every edge.
Dvořák, Zdeněk +3 more
openaire +2 more sources
Oriented hypergraphs: Balanceability
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic
Lucas J. Rusnak +4 more
openaire +2 more sources
Spatial data processing often requires massive datasets, and the task/data scheduling efficiency of these applications has an impact on the overall processing performance.
Bo Cheng, Xuefeng Guan, Huayi Wu, Rui Li
doaj +1 more source
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce complex hypergraphs (chygraphs), bringing together concepts from hypergraphs, multi-layer networks, simplicial ...
openaire +3 more sources

