Results 151 to 160 of about 538 (183)
Some of the next articles are maybe not open access.
2020
Summary: Non-uniform hypergraphs are a generalization of hypergraphs in which not all edges need to have the same cardinality. It allows them to support a more complex data structure. In this paper, we extend some results for non-uniform hypergraphs and generalize the spectral results for uniform hypergraphs to non-uniform hypergraphs.
SHIRDEL, G.H. +2 more
openaire +2 more sources
Summary: Non-uniform hypergraphs are a generalization of hypergraphs in which not all edges need to have the same cardinality. It allows them to support a more complex data structure. In this paper, we extend some results for non-uniform hypergraphs and generalize the spectral results for uniform hypergraphs to non-uniform hypergraphs.
SHIRDEL, G.H. +2 more
openaire +2 more sources
On the capacity of uniform hypergraphs
IEEE Transactions on Information Theory, 1990The capacity of uniform hypergraphs can be defined as a natural generalization of the Shannon capacity of graphs. Corresponding to every uniform hypergraph there is a discrete memoryless channel in which the zero error capacity, in the case of the smallest list size for which it is positive, equals the capacity of the hypergraph, and vice versa.
KORNER, JANOS, Katalin Marton
openaire +3 more sources
The Laplacian of a uniform hypergraph
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng-Long Hu, Liqun Qi 0001
openaire +2 more sources
On the Turán Density of Uniform Hypergraphs
Acta Mathematicae Applicatae Sinica, English Series, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, An, Gao, Guo-rong
openaire +2 more sources
Approximate coloring of uniform hypergraphs
Journal of Algorithms, 2003Summary: We consider an algorithmic problem of coloring \(r\)-uniform hypergraphs. The problem of finding the exact value of the chromatic number of a hypergraph is known to be NP-hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any \(r\geq 3\) it is ...
Michael Krivelevich, Benny Sudakov
openaire +1 more source
Learning a hidden uniform hypergraph
Optimization Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang +2 more
openaire +3 more sources
On random sampling in uniform hypergraphs
Random Structures & Algorithms, 2011AbstractA k‐graph \documentclass{article} \usepackage{amsmath,amsfonts,mathrsfs,amssymb}\pagestyle{empty}\begin{document} ${\mathcal{G}}^{(k)}$ \end{document} on vertex set [n] = {1,…,n} is said to be (ρ,ζ)‐uniform if every S ⊆ [n] of size s = |S| > ζn spans (ρ ± ζ)\documentclass{article} \usepackage{amsmath,amsfonts,mathrsfs,amssymb}\pagestyle ...
Andrzej Czygrinow, Brendan Nagle
openaire +2 more sources
Partitioning dense uniform hypergraphs
Journal of Combinatorial Optimization, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shufei Wu, Jianfeng Hou
openaire +1 more source
2-Colorings of uniform hypergraphs
Mathematical Notes, 2016One of the most popular and classical extremal problems in hypergraph theory is the property of the existence \(2\)-coloring of its vertex set such that no hyper-edge of the hypergraph concerned is monochromatic. Certain bounds for the least number \(m(n)\) of edges of an \(n\)-uniform hypergraph with this property have been determined in the recent ...
Demidovich, Yu. A., Raigorodskii, A. M.
openaire +2 more sources
Matching in 3-uniform hypergraphs
Discrete Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Zhang, Mei Lu
openaire +1 more source