Results 31 to 40 of about 2,959 (186)

Prediction of Graduation Development Based on Hypergraph Contrastive Learning With Imbalanced Sampling

IEEE Access, 2023
With the increasingly competitive job market, the employment issue for college graduates has received more and more attention. Predicting graduation development can help students understand their suitable graduation development, thus easing the pressure ...
Yong Ouyang, Tuo Feng, Rong Gao, Yubin Xu, Jinghang Liu   +4 more
doaj   +1 more source

Lagrangians of Hypergraphs [PDF]

Combinatorics, Probability and Computing, 2002
How large can the Lagrangian of an r-graph with m edges be? Frankl and Füredi [1] conjectured that the r-graph of size m formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-graphs of size m. We prove the first ‘interesting’ case of this conjecture, namely that the 3-graph with (t3) edges and ...
openaire   +2 more sources

Tiling multipartite hypergraphs in quasi-random hypergraphs

Journal of Combinatorial Theory, Series B, 2023
22 pages.
Laihao Ding, Jie Han 0002, Shumin Sun, Guanghui Wang 0002, Wenling Zhou   +4 more
openaire   +3 more sources

Hypernetwork science via high-order hypergraph walks

EPJ Data Science, 2020
We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width.
Sinan G. Aksoy, Cliff Joslyn, Carlos Ortiz Marrero, Brenda Praggastis, Emilie Purvine   +4 more
doaj   +1 more source

Hypergraph categories

Journal of Pure and Applied Algebra, 2019
38 ...
Brendan Fong, David I. Spivak
openaire   +4 more sources

MSHC: a multi-stage hypergraph clustering algorithm

Shenzhen Daxue xuebao. Ligong ban
As a high-dimensional extension of ordinary graphs, hypergraphs can more flexibly reflect high-order complex relationships between nodes. Hypergraph clustering aims to discover complex high-order correlations in powerful hypergraph structures.
ZHANG Chunying, WANG Jing, LIU Lu, LAN Siwu, ZHANG Qingda   +4 more
doaj   +1 more source

An Efficient Algorithm for the Transversal Hypergraph Generation

Journal of Graph Algorithms and Applications, 2005
The Transversal Hypergraph Generation is the problem of generating, given a hypergraph, the set of its minimal transversals, i.e., the hypergraph whose hyperedges are the minimal hitting sets of the given one.
Dimitris Kavvadias, Elias Stavropoulos
doaj   +1 more source

On Universal Hypergraphs

The Electronic Journal of Combinatorics, 2016
A hypergraph $H$ is called universal for a family $\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \in \mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\Delta$ and at most $n$ vertices any universal hypergraph has to contain $\Omega(n^{r-r/\Delta})$ many edges.
Samuel Hetterich, Olaf Parczyk, Yury Person   +2 more
openaire   +3 more sources

Turánnical hypergraphs [PDF]

Random Structures & Algorithms, 2012
AbstractThis paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turán's theorem, which deals with graphs G = ([n],E) such that no member of the restriction set \documentclass{article} \usepackage ...
Peter Allen 0001, Julia Böttcher, Jan Hladký, Diana Piguet   +3 more
openaire   +3 more sources

Niche hypergraphs

Discussiones Mathematicae Graph Theory, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Garske, Martin Sonntag, Hanns-Martin Teichert   +2 more
openaire   +3 more sources