Results 161 to 170 of about 11,596 (195)
Some of the next articles are maybe not open access.
The Laplacian of a uniform hypergraph
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shenglong Hu, Liqun Qi
exaly +2 more sources
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
The Uniformity Lemma for hypergraphs
Graphs and Combinatorics, 1992This is an extension of Szemerédi's theorem called the Uniformity Lemma for Graphs (see \textit{E. Szemerédi} [Problèmes combinatoires et théorie des graphes, Orsay 1976, Colloq. int. CNRS No. 260, 399-401 (1978; Zbl 0413.05055)]) to \(r\)-uniform hypergraphs. Two applications of the result are announced: proof of a conjecture of Erdős concerning Turán-
Peter Frankl, Vojtech Rödl
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 +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
Learning a hidden uniform hypergraph
Optimization Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang +2 more
openaire +2 more sources
Intersection Multigraphs of Uniform Hypergraphs
Graphs and Combinatorics, 1998A hypergraph \(H=(V,\{X_i \mid i\in I\})\) is \(k\)-uniform if all hyperedges \(X_i\) have the same cardinality \(k\); it is \(k\)-conformal if there is some graph \(G\) such that \(H\) is isomorphic to the hypergraph of all cliques with \(k\) vertices of \(G\).
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
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