Results 11 to 20 of about 1,981 (215)
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges [PDF]
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 +4 more sources
Saturated r-uniform hypergraphs [PDF]
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, Zoltán Füredi, Zsolt Tuza
openaire +2 more sources
Wickets in 3-uniform hypergraphs [PDF]
Discrete Mathematics, 2023 In these notes, we consider a Turán-type problem in hypergraphs. What is the maximum number of edges if we forbid a subgraph? Let $H_n^{(3)}$ be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, called {\em wicket}, is formed by three rows and two columns of a $3 \times 3$ point matrix.
Solymosi, Jozsef
openaire +3 more sources
Enumeration of unlabeled uniform hypergraphs [PDF]
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qian, Jianguo, 钱建国
openaire +3 more sources
Asymptotic Enumeration of Non-Uniform Linear Hypergraphs [PDF]
Discussiones Mathematicae Graph Theory, 2022 A linear hypergraph, also known as a partial Steiner system, is a collection of subsets of a set such that no two of the subsets have more than one element in common.
Hasheminezhad Mahdieh, McKay Brendan D.
doaj +2 more sources
Approximate coloring of uniform hypergraphs [PDF]
Journal of Algorithms, 2003 Summary: 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 +2 more sources
On the α-Spectral Radius of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2020 For 0 ≤ α ---lt--- 1 and a uniform hypergraph G, the α-spectral radius of G is the largest H-eigenvalue of αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal tensor of degrees and the adjacency tensor of G, respectively. We give upper bounds for the α-
Guo Haiyan, Zhou Bo
doaj +3 more sources
Quantum walks on regular uniform hypergraphs. [PDF]
Sci Rep, 2018 Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information stored ...
Liu Y, Yuan J, Duan B, Li D.
europepmc +2 more sources
Clique-symmetric uniform hypergraphs [PDF]
, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McSorley, John P, Porter, Thomas
openaire +3 more sources
Prime 3-Uniform Hypergraphs [PDF]
Graphs and Combinatorics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Boussaïri +3 more
openaire +1 more source