Results 11 to 20 of about 2,959 (186)
Hypergraph Based Berge Hypergraphs [PDF]
Graphs and Combinatorics, 2021 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 $\
Martin Balko +4 more
openaire +3 more sources
Journal of Combinatorial Theory, Series B, 2021 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 Bucic +3 more
openaire +4 more sources
Quasirandomness in hypergraphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical' properties are asymptotically equivalent and, thus, a graph $G$ possessing one such property automatically satisfies the ...
Elad Aigner-Horev +4 more
openaire +5 more sources
Infection in hypergraphs [PDF]
Discrete Applied Mathematics, 2018 In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infection number of complete and complete bipartite hypergraphs is determined. A formula for the infection number for interval hypergraphs and several families of cyclic hypergraphs
Ryan Bergen +7 more
openaire +2 more sources
Contributions to Discrete Mathematics, 2023 This article presents an extension of the study of metric and partition dimension to hypergraphs. We give sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.
Imran Javaid +3 more
openaire +3 more sources
, 2011 A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a connected subgraph. We show how to test in polynomial time whether a given hypergraph has a cactus support, i.e. a support that is a tree of edges and cycles.
Brandes, Ulrik +3 more
openaire +3 more sources
Multi-order hypergraph convolutional networks integrated with self-supervised learning
Complex & Intelligent Systems, 2023 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
Multi-site Hyper-graph Convolutional Neural Networks and Application [PDF]
Jisuanji kexue, 2022 Recently,the exploitation of graph neural networks for neurological brain disorder diagnosis has attracted much attention.However,the graphs used in the existing studies are usually based on the pairwise connections of different nodes,and thus cannot ...
ZHOU Hai-yu, ZHANG Dao-qiang
doaj +1 more source
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2023 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 +5 more sources
ISPRS International Journal of Geo-Information, 2016 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