Results 11 to 20 of about 11,526 (190)
Edge Balanced 3-Uniform Hypergraph Designs
Mathematics, 2020 In this paper, we completely determine the spectrum of edge balanced H-designs, where H is a 3-uniform hypergraph with 2 or 3 edges, such that H has strong chromatic number χs(H)=3.
Paola Bonacini +2 more
doaj +4 more sources
Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2018 A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam Paweł
doaj +2 more sources
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +3 more sources
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 +3 more sources
Prime 3-Uniform Hypergraphs [PDF]
Graphs and Combinatorics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Boussaïri +3 more
openaire +1 more source
Transversals in 4-Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2016 Let $H$ be a $4$-uniform hypergraph on $n$ vertices. The transversal number $\tau(H)$ of $H$ is the minimum number of vertices that intersect every edge. The result in [J. Combin. Theory Ser. B 50 (1990), 129—133] by Lai and Chang implies that $\tau(H) \le 7n/18$ when $H$ is $3$-regular. The main result in [Combinatorica 27 (2007), 473—487] by Thomassé
Henning, Michael A, Yeo, Anders
openaire +4 more sources
Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs [PDF]
Scientific Reports, 2016 AbstractFirstly, this paper proposes a non-uniform evolving hypergraph model with nonlinear preferential attachment and an attractiveness. This model allows nodes to arrive in batches according to a Poisson process and to form hyperedges with existing batches of nodes.
Jin-Li Guo +3 more
openaire +2 more sources
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2023 Let H = (V, E) be a hypergraph, where V is a set of vertices and E is a set of non-empty subsets of V called edges. If all edges of H have the same cardinality r, then H is an r-uniform hypergraph; if E consists of all r-subsets of V, then H is a ...
Tian Yingzhi +3 more
doaj +1 more source
Cycle Decompositions in 3-Uniform Hypergraphs
Combinatorica, 2023 We show that $3$-graphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing that our bounds are best possible up to the $o(1)$ term.
Piga, Simón +1 more
openaire +2 more sources
Covering Non-uniform Hypergraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boros, Endre +3 more
openaire +2 more sources