Results 111 to 120 of about 1,405,425 (255)
Journal of Combinatorial Designs, Volume 33, Issue 8, Page 300-309, August 2025.ABSTRACT We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that burning spreads to neighboring vertices over time via a specified propagation rule.
Anthony Bonato +3 more
wiley +1 more source
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Journal of Graph Theory, Volume 109, Issue 4, Page 466-480, August 2025.ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros +3 more
wiley +1 more source
A Measure for the Vulnerability of Uniform Hypergraph Networks: Scattering Number
MathematicsThe scattering number of a graph G is defined as s(G)=max{ω(G−X)−|X|:X⊂V(G),ω(G−X)>1}, where X is a cut set of G, and ω(G−X) denotes the number of components in G−X, which can be used to measure the vulnerability of network G.
Ning Zhao, Haixing Zhao, Yinkui Li
doaj +1 more source
Hamiltonicity and $\sigma$-hypergraphs
Theory and Applications of Graphs, 2014 We define and study a special type of hypergraph. A $\sigma$-hypergraph $H= H(n,r,q$ $\mid$ $\sigma$), where $\sigma$ is a partition of $r$, is an $r$-uniform hypergraph having $nq$ vertices partitioned into $ n$ classes of $q$ vertices each.
Christina Zarb
doaj +1 more source
Structure of Lower Tails in Sparse Random Graphs
Random Structures &Algorithms, Volume 67, Issue 1, August 2025.ABSTRACT We study the typical structure of a sparse Erdős–Rényi random graph conditioned on the lower tail subgraph count event. We show that in certain regimes, a typical graph sampled from the conditional distribution resembles the entropy minimizer of the mean field approximation in the sense of both subgraph counts and cut norm.
Byron Chin
wiley +1 more source
Constrained Colouring and σ-Hypergraphs
Discussiones Mathematicae Graph Theory, 2015 A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours.
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
A Note on the Lagrangian of Linear 3-Uniform Hypergraphs [PDF]
, 2022 Sinan Hu, Biao Wu
openalex +1 more source
Cycle decompositions in k-uniform hypergraphs
Journal of Combinatorial Theory, Series Bv3: including referee comments.
Allan Lo +2 more
openaire +3 more sources
On extremal spectral radius of blow-up uniform hypergraphs [PDF]
, 2023 Shao-Han Xu, Futao Hu, Yi Wang
openalex +1 more source
The Algebraic Multiplicity of the Spectral Radius of a Uniform Hypertree
Electronic Journal of CombinatoricsIt is well-known that the spectral radius of a connected uniform hypergraph is an eigenvalue of the hypergraph. However, its algebraic multiplicity remains unknown.
Lixiang Chen, Changjiang Bu
semanticscholar +1 more source