A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Let p(G) denote the number of pairs of adjacent edges in a graph G. Ahlswede and Katona considered the problem of maximizing p(G) over all simple graphs with a given number n of vertices and a given number N of edges. They showed that p(G) is either maximized by a quasi-complete graph or by a quasi-star. They also studied the range of N (depending on n) for which the quasi-complete graph is superior to the quasi-star (and vice versa) and formulated two questions on distributions in thisdoi:10.1556/sscmath.2009.1107 fatcat:stqdq5wuxzgorixayduxpklcxq