A γ-quasi-clique in a simple undirected graph is a set of vertices which induces a subgraph with the edge density of at least γ for 0 < γ < 1. A cover of a graph by γ-quasi-cliques is a set of γ-quasi-cliques where each edge of the graph is contained in at least one quasi-clique. The minimum cover by γ-quasi-cliques problem asks for a γ-quasi-clique cover with the minimum number of quasi-clique...

The structure of graded triangular algebras T of arbitrary dimension are studied in this paper. This is motivated in part for the important role that triangular algebras play in the study of oriented graphs, upper triangular matrix algebras or nest algebras. It is shown that T decomposes as T = U + ( ∑ i∈I Ti), where U is an R-submodule contained in the 0-homogeneous component and any Ti a well...

A central proposition of the transaction costs literature is that firms will substitute more complicated contractual arrangements for simple spot arrangements when transactions involve relationship-specific investments. I investigate this proposition by testing whether simple spot arrangements are less common when local trucking markets are thin. I find that doubling the thickness of the market...