Pages that link to "Item:Q1024737"
From MaRDI portal
The following pages link to A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737):
Displayed 43 items.
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs (Q276313) (← links)
- Spectra of uniform hypergraphs (Q417456) (← links)
- On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph (Q486195) (← links)
- A new definition of geometric multiplicity of eigenvalues of tensors and some results based on it (Q493371) (← links)
- On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
- Independent sets in graphs (Q501998) (← links)
- The connection between polynomial optimization, maximum cliques and Turán densities (Q528562) (← links)
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs (Q722592) (← links)
- Chris Cannings: a life in games (Q831064) (← links)
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications (Q906443) (← links)
- Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
- On the uniqueness of the positive Z-eigenvector for nonnegative tensors (Q1736351) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph (Q1945578) (← links)
- Geometric simplicity of spectral radius of nonnegative irreducible tensors (Q1945579) (← links)
- A homogeneous polynomial associated with general hypergraphs and its applications (Q2174504) (← links)
- Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs (Q2240668) (← links)
- The Laplacian of a uniform hypergraph (Q2253955) (← links)
- Adjacency spectra of random and complete hypergraphs (Q2309685) (← links)
- A Motzkin-Straus type result for 3-uniform hypergraphs (Q2376079) (← links)
- On Motzkin-Straus type results for non-uniform hypergraphs (Q2410100) (← links)
- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs (Q2435375) (← links)
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues (Q2435506) (← links)
- Bounds for the greatest eigenvalue of positive tensors (Q2438419) (← links)
- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph (Q2449065) (← links)
- Some results on Lagrangians of hypergraphs (Q2636814) (← links)
- Spectral directed hypergraph theory via tensors (Q2805662) (← links)
- A survey on the spectral theory of nonnegative tensors (Q2936739) (← links)
- The dominant eigenvalue of an essentially nonnegative tensor (Q2936741) (← links)
- On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph (Q2936747) (← links)
- A Game-Theoretic Approach to Graph Clustering (Q2940545) (← links)
- (Q4968665) (← links)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- Clustering in Hypergraphs to Minimize Average Edge Service Time (Q5111753) (← links)
- Computing hypermatrix spectra with the Poisson product formula (Q5175372) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- Some Motzkin-Straus type results for non-uniform hypergraphs (Q5963619) (← links)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658) (← links)
- Even order uniform hypergraph via the Einstein product (Q6085199) (← links)
- On some spectral radius inequalities for the Hadamard product of nonnegative tensors (Q6145518) (← links)