Results 21 to 30 of about 1,981 (215)
Coloring [Formula: see text]-Embeddable [Formula: see text]-Uniform Hypergraphs. [PDF]
Discrete Comput Geom, 2014 This paper extends the scenario of the Four Color Theorem in the following way. LetHd,k be the set of all k-uniform hypergraphs that can be (linearly) embedded into Rd.
Heise CG +3 more
europepmc +2 more sources
On the irregularity of uniform hypergraphs [PDF]
European Journal of Combinatorics, 2018 14 ...
Lele Liu, Liying Kang, Erfang Shan
openaire +2 more sources
On Laplacian Energy of r-Uniform Hypergraphs [PDF]
, 2023 The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent studies, the Laplacian matrix of hypergraphs, a generalization of the Laplacian matrix, has been introduced.
N. Feyza Yalçın
core +1 more source
A Cheeger Cut for Uniform Hypergraphs [PDF]
Graphs and Combinatorics, 2021 AbstractThe graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is bounded both above and below by the generalized Cheeger constant, and the corresponding eigenfunctions can ...
openaire +5 more sources
On Lagrangians of r-uniform hypergraphs [PDF]
Journal of Combinatorial Optimization, 2013 A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in [7]. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It has been also applied in spectral graph theory.
Yuejian Peng +2 more
openaire +3 more sources
Sampling uniform hypergraphs with given degrees [PDF]
, 2022 Graphs are combinatorial objects commonly used to model relationships between pairs of entities. Hypergraphs are a generalization of graphs in which edges connect an arbitrary number of vertices.
Ross, James
core +2 more sources
Uniform hypergraphs containing no grids [PDF]
, 2013 A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Spectra of uniform hypergraphs
Linear Algebra and its Applications, 2012 We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a. multidimensional arrays.
Cooper, Joshua, Dutle, Aaron
openaire +3 more sources
Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs [PDF]
, 2023 The Pareto H-eigenvalues of nonnegative tensors and (adjacency tensors of) uniform hypergraphs are studied. Particularly, it is shown that the Pareto H-eigenvalues of a nonnegative tensor are just the spectral radii of its weakly irreducible principal ...
Zhou, Bo, Zheng, Lu
core +1 more source