Results 21 to 30 of about 1,405,425 (255)
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
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
Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles [PDF]
Opuscula Mathematica, 2020 It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order \(v\) if and only if \(v \equiv 0, 1,\text{ or }2\ (\operatorname{mod} 9)\).
Ryan C. Bunge +5 more
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
Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length [PDF]
Opuscula Mathematica, 2020 A complete \(3\)-uniform hypergraph of order \(n\) has vertex set \(V\) with \(|V|=n\) and the set of all \(3\)-subsets of \(V\) as its edge set. A \(t\)-cycle in this hypergraph is \(v_1, e_1, v_2, e_2,\dots, v_t, e_t, v_1\) where \(v_1, v_2,\dots, v_t\)
R. Lakshmi, T. Poovaragavan
doaj +1 more source
A simple and sharper proof of the hypergraph Moore bound [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2022 The hypergraph Moore bound is an elegant statement that characterizes the extremal trade-off between the girth - the number of hyperedges in the smallest cycle or even cover (a subhypergraph with all degrees even) and size - the number of hyperedges in a
Jun-Ting Hsieh +2 more
semanticscholar +1 more source
Conflict‐free hypergraph matchings [PDF]
Journal of the London Mathematical Society, 2022 A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost‐regular, uniform hypergraph H$\mathcal {H}$ with small maximum codegree has an almost‐perfect matching.
Stefan Glock +4 more
semanticscholar +1 more source
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
Inverse Perron Values and Connectivity of a Uniform Hypergraph [PDF]
Electronic Journal of Combinatorics, 2017 In this paper, we show that a uniform hypergraph $\mathcal{G}$ is connected if and only if one of its inverse Perron values is larger than $0$. We give some bounds on the bipartition width, isoperimetric number and eccentricities of $\mathcal{G}$ in ...
Changjiang Bu, Haifeng Li, Jiang Zhou
semanticscholar +1 more source
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2023 Let $n,s,$ and $k$ be positive integers such that $k\geq 3$, $s\geq 3$ and $n\geq ks$. An $s$-matching $M_s$ in a $k$-uniform hypergraph is a set of $s$ pairwise disjoint edges.
Mingyang Guo, Hongliang Lu, Xing Peng
semanticscholar +1 more source