Results 21 to 30 of about 1,354,678 (274)
A hyperedge coloring and application in combinatorial testing
AKCE International Journal of Graphs and Combinatorics, 2022 For a hypergraph H, a uniform k-coloring of hyperedges always has the same (to within 1) number of hyperedges of each color, whereas an equitable k-coloring of hyperedges has the property that at every vertex all the colors incident the same number of ...
Yasmeen Akhtar
doaj +1 more source
Even order uniform hypergraph via the Einstein product
AKCE International Journal of Graphs and Combinatorics, 2023 We propose the algebraic connectivity of an undirected 2m-uniform hypergraph under the Einstein product. We generalize the algebraic connectivity to a directed 2m-uniform hypergraph and reveal the relationship between the vertex connectivity and the ...
Jiaqi Gu, Yimin Wei
doaj +1 more source
Subdivision of hypergraphs and their colorings [PDF]
Opuscula Mathematica, 2020 In this paper we introduce the subdivision of hypergraphs, study their properties and parameters and investigate their weak and strong chromatic numbers in various cases.
Moharram N. Iradmusa
doaj +1 more source
Analytic methods for uniform hypergraphs [PDF]
Linear Algebra and its Applications, 2013 71 pages.
Vladimir Nikiforov
openalex +4 more sources
Simplicial SIS model in scale-free uniform hypergraph [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2019 The hypergraph offers a platform to study structural properties emerging from more complicated and higher-order than pairwise interactions among constituents and dynamical behavior such as the spread of information or disease.
Bukyoung Jhun, Minjae Jo, B. Kahng
semanticscholar +1 more source
On the irregularity of uniform hypergraphs [PDF]
European Journal of Combinatorics, 2018 14 ...
Lele Liu, Liying Kang, Erfang Shan
openaire +3 more sources
A note on packing of uniform hypergraphs
Discussiones Mathematicae Graph Theory, 2021 A packing of two $k$-uniform hypergraphs $H_1$ and $H_2$ is a set $\{H_1', H_2'\}$ of edge-disjoint sub-hypergraphs of the complete $k$-uniform hypergraph $K_n^{(k)}$ such that $H_1'\cong H_1$ and $H_2'\cong H_2$. Whilst the problem of packing of graphs (i.e.
Jerzy Konarski +2 more
openaire +3 more sources
Anti-Ramsey Hypergraph Numbers
Electronic Journal of Graph Theory and Applications, 2021 The anti-Ramsey number arn(H) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H.
Mark Budden, William Stiles
doaj +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
Learning Non-Uniform Hypergraph for Multi-Object Tracking [PDF]
AAAI Conference on Artificial Intelligence, 2018 The majority of Multi-Object Tracking (MOT) algorithms based on the tracking-by-detection scheme do not use higher order dependencies among objects or tracklets, which makes them less effective in handling complex scenarios.
Longyin Wen +4 more
semanticscholar +1 more source