Results 141 to 150 of about 56,011 (266)
, 2022 Given a family S of five subsets of a 10-set, suppose |A△B|≥6 for all different A,B∈S. Prove that |A△B|=6 for all different A,B∈S.
openaire +1 more source
Sum-List Colouring of Unions of a Hypercycle and a Path with at Most Two Vertices in Common
Discussiones Mathematicae Graph Theory, 2020 Given a hypergraph and a function f : V () → , we say that is f-choosable if there is a proper vertex colouring ϕ of such that ϕ (v) ∈ L(v) for all v ∈ V (), where L : V () → 2 is any assignment of f(v) colours to a vertex v.
Drgas-Burchardt Ewa +1 more
doaj +1 more source
Tournaments, 4-uniform hypergraphs, and an exact extremal result
, 2016 We consider $4$-uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of $5$ vertices spans either $0$ or exactly $2$ hyperedges and give a construction, using quadratic residues, for an infinite family of such
Gunderson, Karen, Semeraro, Jason
core
A Note on the Lagrangian of Linear 3-Uniform Hypergraphs [PDF]
, 2022 Sinan Hu, Biao Wu
openalex +1 more source
Random Walks on Hypergraphs with Edge-Dependent Vertex Weights
, 2019 Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research.
Chitra, Uthsav, Raphael, Benjamin J
core
HyperGodot: Interactive hypergraph visualization tool
SoftwareXHypergraphs provide a robust framework for modeling complex, multi-actor interactions that traditional graphs struggle to represent. In many real-world applications, interactions involve more than just pairs of entities, which makes hypergraphs an ...
Attila Ficsor +3 more
doaj +1 more source
Connected components in networks with higher-order interactions
Journal of Physics: ComplexityWe address the problem of defining connected components in hypergraphs, which are models for systems with higher-order interactions. For graphs with dyadic interactions, connected components are defined in terms of paths connecting nodes along the graph.
Gyeong-Gyun Ha +2 more
doaj +1 more source
Minimum-Weight Edge Discriminators in Hypergraphs [PDF]
, 2014 Bhaswar B. Bhattacharya +2 more
openalex +1 more source
Hypergraph-Mlp: Learning on Hypergraphs Without Message Passing
ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)Hypergraphs are vital in modelling data with higher-order relations containing more than two entities, gaining prominence in machine learning and signal processing. Many hypergraph neural networks leverage message passing over hypergraph structures to enhance node representation learning, yielding impressive performances in tasks like hypergraph node ...
Tang, B, Chen, S, Dong, X
openaire +3 more sources
Multi-omics data integration analysis of prostate cancer based on sparse least partial squares regression algorithm based on hypergraph regularization [PDF]
, 2023 Ruohui Huang +8 more
openalex +1 more source