Results 91 to 100 of about 25,758 (195)

Modularity Definition and Optimization Algorithm for Community Detection in Signed Hypergraphs

Complexity
The analysis of super-dyadic relations through hypergraphs is gradually gaining attention, with its community structure analysis playing a crucial role in computational social science.
Wei Du, Guangyu Li
doaj   +1 more source

Decomposing 1-Sperner hypergraphs

, 2018
A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality) with positive
Boros, Endre, Gurvich, Vladimir, Milanič, Martin   +2 more
core  

Small triangles

Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract Heilbronn's triangle problem is a classical question in discrete geometry. It asks to determine the smallest number Δ=Δ(N)$\Delta = \Delta (N)$ for which every collection in N$N$ points in the unit square spans a triangle with area at most Δ$\Delta$.
Dmitrii Zakharov
wiley   +1 more source

The upper chromatic number of quasi-interval co-hypergraphs

Le Matematiche, 1997
We investigate the structural and colouring properties of clique hyper-graphs of interval graphs called the quasi-interval hypergraphs. We find the conditions when they are interval hypergraphs. The upper chromatic number for the clique co-hypergraphs of
Violeta Prisakaru
doaj  

Stall‐Free Asynchronous State Repartitioning With a Proactive Workload Tracking Window

Concurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.
ABSTRACT High‐throughput stateful applications rely on dynamic data repartitioning to adapt to changing workloads, but this process presents significant challenges. This paper provides a detailed analysis of such challenges, drilling down into the tradeoffs between adaptation, computational overhead, and service availability. We identify that a primary
Douglas Pereira Luiz, Odorico Machado Mendizabal   +1 more
wiley   +1 more source

Census and Analysis of Higher-Order Interactions in Real-World Hypergraphs

Big Data Mining and Analytics
Complex systems can be more accurately described by higher-order interactions among multiple units. Hypergraphs excel at depicting these interactions, surpassing the binary limitations of traditional graphs.
Xihang Meng, Xuemeng Zhai, Gaolei Fei, Sheng Wen, Guangmin Hu   +4 more
doaj   +1 more source

The complexity of recognizing $ABAB$-free hypergraphs [PDF]

Discrete Mathematics & Theoretical Computer Science
The study of geometric hypergraphs gave rise to the notion of $ABAB$-free hypergraphs. A hypergraph $\mathcal{H}$ is called $ABAB$-free if there is an ordering of its vertices such that there are no hyperedges $A,B$ and vertices $v_1,v_2,v_3,v_4$ in this
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi, Karamjeet Singh   +3 more
doaj   +1 more source

A note on self-complementary hypergraphs [PDF]

Opuscula Mathematica, 2005
In the paper we describe all self-complementary hypergraphs. It turns out that such hypergraphs exist if and only if the number of vertices of the hypergraph is of the form \(n=2^k\). This answers a conjecture posed by A.
Małgorzata Zwonek
doaj  

Hypergraphs

, 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

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