This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...