Pages that link to "Item:Q5338788"
From MaRDI portal
The following pages link to Maxima for Graphs and a New Proof of a Theorem of Turán (Q5338788):
Displaying 50 items.
- On Frankl and Füredi's conjecture for 3-uniform hypergraphs (Q272804) (← links)
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs (Q276313) (← links)
- Maximum weighted induced subgraphs (Q279221) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- On graph-Lagrangians and clique numbers of 3-uniform hypergraphs (Q326974) (← links)
- Turán number of generalized triangles (Q346455) (← links)
- Some extremal problems for hereditary properties of graphs (Q405091) (← links)
- Extremal problems for the \(p\)-spectral radius of graphs (Q405309) (← links)
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- An improved algorithm to test copositivity (Q427387) (← links)
- On possible Turán densities (Q466081) (← links)
- On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges (Q467468) (← links)
- Tag SNP selection based on clustering according to dominant sets found using replicator dynamics (Q481938) (← links)
- A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
- Independent sets in graphs (Q501998) (← links)
- A note on generalized Lagrangians of non-uniform hypergraphs (Q523141) (← links)
- The connection between polynomial optimization, maximum cliques and Turán densities (Q528562) (← links)
- Geometry of the copositive and completely positive cones (Q534759) (← links)
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs (Q722592) (← links)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families (Q785827) (← links)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures (Q794664) (← links)
- Ernst G. Straus (1922-1983) (Q800339) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- Asymptotic solution for a new class of forbidden r-graphs (Q809090) (← links)
- On substructure densities of hypergraphs (Q844225) (← links)
- Walks and the spectral radius of graphs (Q852649) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390) (← links)
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications (Q906443) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- A note on the structure of Turán densities of hypergraphs (Q937246) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
