Maxima for Graphs and a New Proof of a Theorem of Turán

DOI10.4153/CJM-1965-053-6zbMath0129.39902WikidataQ90158321 ScholiaQ90158321MaRDI QIDQ5338788

Publication date: 1965

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

05C35: Extremal problems in graph theory

Related Items

The inducibility of complete bipartite graphs, Neural networks for NP-complete problems, Constructing test functions for global optimization using continuous formulations of graph problems, Improving an upper bound on the stability number of a graph, Variable neighborhood search for the maximum clique, Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures, Ernst G. Straus (1922-1983), Algorithms for the solution of quadratic knapsack problems, Extremal problems whose solutions are the blowups of the small Witt- designs, Asymptotic solution for a new class of forbidden r-graphs, Walks and the spectral radius of graphs, Fixed interval scheduling: models, applications, computational complexity and algorithms, A linear programming reformulation of the standard quadratic optimization problem, A characterization of Delsarte's linear programming bound as a ratio bound, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Using Lagrangians of hypergraphs to find non-jumping numbers. II., Spectral bounds for the clique and independence numbers of graphs, Optima of dual integer linear programs, On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs, Extremals of functions on graphs with applications to graphs and hypergraphs, Extremal graphs for weights, Stable sets and polynomials, The maximum clique problem, On the jumping constant conjecture for multigraphs, A lower bound on the independence number of a graph, Annealed replication: A new heuristic for the maximum clique problem, Exact bounds on the order of the maximum clique of a graph., Matchings and covers in hypergraphs, On copositive matrices, The complexity of approximating a nonlinear program, On copositive matrices with -1, 9, 1 entries, Turán-Ramsey theorems and simple asymptotically extremal structures, Numerical radius and zero pattern of matrices, A new trust region technique for the maximum weight clique problem, On a polynomial fractional formulation for independence number of a graph, A convergent decomposition algorithm for support vector machines, A hybrid heuristic for the maximum clique problem, A PTAS for the minimization of polynomials of fixed degree over the simplex, Two remarks on copositive matrices, A generalization of a theorem of Turán, Extremal problems for directed graphs, Quartic formulation of standard quadratic optimization problems, A hypergraph extension of Turán's theorem, D.C. versus copositive bounds for standard QP, Improved approximation of maximum vertex cover, Laplacian spectral bounds for clique and independence numbers of graphs, Cliques and the spectral radius, Image Segmentation by Dominant Sets, Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming, A spinorial formulation of the maximum clique problem of a graph, Algorithmic Solution of Extremal Digraph Problems, Inequalities in probability theory and turán-type problems for graphs with colored vertices, A global optimization approach for solving the maximum clique problem, Optimisation of quadratic forms associated with graphs