Results 81 to 90 of about 653 (189)
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
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
Some applications of matching theorems
, 2010 PhDThis thesis contains the results of two investigations. The rst concerns the 1- factorizability of regular graphs of high degree. Chetwynd and Hilton proved in 1989 that all regular graphs of order 2n and degree 2n where > 1 2 ( p 7 1) 0 ...
Vaughan, Emil Richard
core
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
, 1986 Let D(n)(D(n, k)) denote the maximum possible d such that there exists a d-regular hypergraph (d-regular k-uniform hypergraph, respectively) on n vertices containing no proper regular spanning subhypergraph.
Berman, K.A, Alon, N
core +1 more source
Regularity inheritance in hypergraphs
, 2019 We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding sparse hypergraph regularity lemma.
Allen, Peter +2 more
openaire +2 more sources
Counting in hypergraphs via regularity inheritance [PDF]
Electronic Notes in Discrete Mathematics, 2015 We develop a theory of regularity inheritance in 3-uniform hypergraphs. As a simple consequence we deduce a strengthening of a counting lemma of Frankl and Rodl. We believe that the approach is sufficiently flexible and general to permit extensions of our results in the direction of a hypergraph blow-up lemma.
openaire +1 more source
Visual Analytics for Temporal Hypergraph Model Exploration
, 2021 Many processes, from gene interaction in biology to computer networks to social media, can be modeled more precisely as temporal hypergraphs than by regular graphs. This is because hypergraphs generalize graphs by extending edges to connect any number of
Fischer, Maximilian T. +5 more
core +1 more source
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
, 2018 In this paper, we continue our study of 2-colorings in hypergraphs (see, Henning and Yeo, 2013). A hypergraph is 2-colorable if there is a 2-coloring of the vertices with no monochromatic hyperedge.
Michael A. Henning +3 more
core +1 more source
A natural barrier in random greedy hypergraph matching
, 2018 Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D→∞ as N→∞ and that co-degrees of pairs of vertices in H are at most L where L=o(D/log5N).
Tom Bohman (5364587) +1 more
core +1 more source
Higher-Order Regularization Learning on Hypergraphs
CoRRHigher-Order Hypergraph Learning (HOHL) was recently introduced as a principled alternative to classical hypergraph regularization, enforcing higher-order smoothness via powers of multiscale Laplacians induced by the hypergraph structure. Prior work established the well- and ill-posedness of HOHL through an asymptotic consistency analysis in geometric ...
Adrien Weihs +2 more
openaire +2 more sources