Results 131 to 140 of about 1,981 (215)
Focal-free uniform hypergraphs and codes [PDF]
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection between the maximum size of focal-free hypergraphs and the renowned Erdős ...
Huang, Xinqi +3 more
core +1 more source
Since Beineke's work in 1968 on linegraphs, attention has focused on the classification of graphs as linegraphs. It is known that every graph $G$ is the linegraph of an hypergraph, and the question is to characterize that root graph.
Dominique Barth +2 more
doaj +1 more source
Cycle decompositions in $k$-uniform hypergraphs [PDF]
We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions.
Lo, Allan +4 more
core +2 more sources
Online matching on 3-uniform hypergraphs
Abstract The online matching problem was introduced by Karp, Vazirani and Vazirani (STOC 1990) on bipartite graphs with vertex arrivals. It is well-known that the optimal competitive ratio is $$1-1/e$$
S.J. Borst (Sander) +2 more
openaire +6 more sources
Cover-free families on hypergraphs and combinatorial group testing. [PDF]
Idalino TB, Moura L.
europepmc +1 more source
Information theory for hypergraph similarity. [PDF]
Felippe H, Kirkley A, Battiston F.
europepmc +1 more source
Graph and Hypergraph Theories Applied to Dynamic Protein-Protein Interaction Network Analysis, and Deep-Learning Frameworks for Protein Complex Network Prediction. [PDF]
Chan KY +4 more
europepmc +1 more source
Strategy evolution on temporal hypergraphs. [PDF]
Wang X, Zhou L, McAvoy A, Tian Z, Li A.
europepmc +1 more source
Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features. [PDF]
Cervellini M +3 more
europepmc +1 more source

