Results 81 to 90 of about 8,099 (222)
A New Transport Distance and Its Associated Ricci Curvature of Hypergraphs
Analysis and Geometry in Metric Spaces, 2022 The coarse Ricci curvature of graphs introduced by Ollivier as well as its modification by Lin–Lu– Yau have been studied from various aspects. In this paper, we propose a new transport distance appropriate for hypergraphs and study a generalization of ...
Akamatsu Tomoya
doaj +1 more source
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
Chromatic polynomials of hypergraphs and mixed hypergraphs
, 2020 This thesis covers two main topics: chromatic polynomials of hypergraphs and mixed ...
Zhang, Ruixue
core
On the separability of elements and sets in hypergraphs of models of a theory
Қарағанды университетінің хабаршысы. Математика сериясы, 2016 We consider topological properties of hypergraphs of models of a theory. The separability of elements in these hypergraphs is characterized in terms of algebraic closures. Similarly we specify the separability of sets by the hypergraphs.
S.V. Sudoplatov
doaj
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
The Uniformity Space of Hypergraphs
, 2012 For a hypergraph H=(V,E) and a field F, a weighting of H is a map f:V ?F. A weighting is called stable if there is some k ? F such that the sum of the weights on each edge of H is equal to k.
Mol, Lucas
core
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
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
A Vulnerability Lens for Intuitive‐Logic Scenarios
FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
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