A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Which graphs, in the class of all graphs with given numbers n and m of edges and vertices respectively, minimizes or maximizes the value of some graph parameter? In this paper we develop a technique which provides answers for several different parameters: the numbers of edges in the line graph, acyclic orientations, cliques, and forests. (We minimize the first two and maximize the third and fourth.) Our technique involves two moves on the class of graphs. A compression move converts any grapharXiv:1307.5781v1 fatcat:mzplvihkwrazdfwqqrits4vnqu