Results 131 to 140 of about 1,405,425 (255)
The Minimum Number of Edges in Uniform Hypergraphs with Property O [PDF]
, 2017 Dwight Duffus, Bill Kay, Vojtěch Rödl
openalex +1 more source
Online Matching on 3-Uniform Hypergraphs
The online matching problem was introduced by Karp, Vazirani and Vazirani (STOC 1990) on bipartite graphs with vertex arrivals. It is well-known that the optimal competitive ratio is $1-1/e$ for both integral and fractional versions of the problem.
Sander Borst +2 more
openaire +3 more sources
‘The Asymptotic Number of Connected d-Uniform Hypergraphs’ — CORRIGENDUM [PDF]
, 2014 Michael Behrisch +2 more
openalex +1 more source
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
Discussiones Mathematicae Graph Theory, 2016 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan Yi-Zheng +3 more
doaj +1 more source
On the irregularity of uniform hypergraphs [PDF]
, 2018 Lele Liu, Liying Kang, Shan, Erfang
openalex +1 more source
Discrete Mathematics, 1986 \textit{D. Buset} [Discrete Math. 57, 297-299 (1985; Zbl 0587.05030)] determined for \(k=2\) the sets of all pairs (a,b) such that there exists a k-uniform (connected k-uniform) hypergraph whose automorphism group has exactly a orbits on the set of vertices and b orbits on the set of edges. The author extended this result for arbitrary natural k.
openaire +1 more source
Constructing sparsest $\\ell$-hamiltonian saturated $k$-uniform\n hypergraphs for a wide range of $\\ell$ [PDF]
, 2021 Andrzej Ruciński, Andrzej Żak
openalex +1 more source
Perfect matchings in 4-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2016 A perfect matching in a 4-uniform hypergraph is a subset of $\lfloor\frac{n}{4}\rfloor$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n=4k$ vertices such that every vertex belongs to more than ${n-1\choose 3} - {3n/4 \choose 3}$ edges then $H$ contains a perfect matching.
openaire +3 more sources
Chromatic Coefficients of Linear Uniform Hypergraphs
Journal of Combinatorial Theory, Series B, 1998 Formulae are given for the coefficients of the highest powers of \(\lambda\) in the chromatic polynomial \(P(H,\lambda)\) of a linear uniform \(h\)-hypergraph \(H\), thus generalizing the corresponding result of \textit{G. H. J. Meredith} for graphs [J. Comb. Theory, Ser. B 13, 14-17 (1972; Zbl 0218.05056)]. Some differences appear whenever (\(g= 3\), \
openaire +2 more sources