Results 91 to 100 of about 10,205 (230)
Hypergraph models of metabolism
, 2014 In this paper, we employ a directed hypergraph model to investigate the extent to which environmental variability influences the set of available biochemical reactions within a living cell.
Crofts, JJ, Chuzhanova, N, Pearcy, N
core
Semi-supervised Hypergraph Node Classification on Hypergraph Line Expansion
, 2023 Previous hypergraph expansions are solely carried out on either vertex level or hyperedge level, thereby missing the symmetric nature of data co-occurrence, and resulting in information loss.
Yao, Shuochao +3 more
core
Erdős‐Rogers Functions for Arbitrary Pairs of Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Let fF,G(n)$$ {f}_{F,G}(n) $$ be the largest size of an induced F$$ F $$‐free subgraph that every n$$ n $$‐vertex G$$ G $$‐free graph is guaranteed to contain. We prove that for any triangle‐free graph F$$ F $$, fF,K3(n)=fK2,K3(n)1+o(1)=n12+o(1).$$ {f}_{F,{K}_3}(n)={f}_{K_2,{K}_3}{(n)}^{1+o(1)}={n}^{\frac{1}{2}+o(1)}. $$Along the way we give a
Dhruv Mubayi, Jacques Verstraëte
wiley +1 more source
Topology and its Applications, 2011 We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra.
Došen, Kosta, Petrić, Zoran
openaire +3 more sources
Noise-robust classification with hypergraph neural network
, 2021 This paper presents a novel version of the hypergraph neural network method. This method is utilized to solve the noisy label learning problem. First, we apply the PCA dimensional reduction technique to the feature matrices of the image datasets in order
Tran, Loc +3 more
core +1 more source
The dynamics of criminal collaboration: Multiplex ties in mafia networks
Criminology, Volume 64, Issue 2, Page 284-312, May 2026.Abstract This study examines how social embeddedness and multiplex relationships shape criminal collaboration within organized crime networks. Drawing on data from three major investigations into the ‘Ndrangheta, we analyze how kinship, clan affiliation, leadership, and prior interactions influence participation in meetings and phone calls.
Francesco Calderoni +2 more
wiley +1 more source
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Sonntag, Hanns-Martin Teichert
openaire +2 more sources
Fractional clique decompositions of dense hypergraphs
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract In 2014, Keevash famously proved the existence of (n,q,r)$(n,q,r)$‐Steiner systems as part of settling the Existence Conjecture of Combinatorial Designs (dating from the mid‐1800s). In 2020, Glock, Kühn, and Osthus conjectured a minimum degree generalization: specifically that minimum (r−1)$(r-1)$‐degree at least (1−Cqr−1)n$(1-\frac{C}{q^{r-1}}
Michelle Delcourt +2 more
wiley +1 more source
European Journal of Combinatorics, 2001 Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)]
openaire +2 more sources
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barry Guiduli, Zoltán Király
openaire +2 more sources